Sigma Notation (Fence-Post n-m+1 Terms) & Periodic Recurrence Relations (uₙ₊₁ = f(uₙ))
Master Sigma Notation (Fence-Post n-m+1 Terms) & Periodic Recurrence Relations (uₙ₊₁ = f(uₙ)) on the ESAT Mathematics 2 paper. Traditional classroom derivations waste valuable seconds. Using the 2-step Sub-90 invariant elimination method compresses solve time to 45s, saving +110s per question.
2-Step Sub-90 Shortcut Formula
How to eliminate intermediate algebra and solve under 45 seconds.
Establish the structural invariant and eliminate impossible options immediately.
Evaluate the simplified expression using integer factoring or unit elimination.
Distractor Trap Forensics
The predictable cognitive traps engineered by examiners into the wrong options.
Using (n - m) terms instead of (n - m + 1) terms in sumᵣ₌ₘⁿ c
Classic fence-post off-by-one error when lower summation index m > 1.
Miscounting the remainder term when dividing total terms N by cycle period k (e.g. 100 = 33*3 + 1)
Dropping the final partial-cycle term in a periodic recurrence sum.
Failing to alternate signs (-1)ⁿ correctly on odd vs even indices
Treating (-1)ⁿ as +1 on odd n.
Try 1 Timed Question: Sigma Notation (Fence-Post n-m+1 Terms) & Periodic Recurrence Relations (uₙ₊₁ = f(uₙ))
Experience the Pearson VUE exam simulator with live split stopwatch.
Ready to Start Question 1?
The question stem, diagram, and answer options are hidden behind this pre-start gate. When you click below, the question will reveal and your 90-second split stopwatch will immediately begin ticking.
Lock in Sigma Notation (Fence-Post n-m+1 Terms) & Periodic Recurrence Relations (uₙ₊₁ = f(uₙ)) with 15 Dedicated Questions
Solve full-length questions from our verified question bank, review distractor traps, and verify your pace.