What is the difference between a recurrence relation and an nth-term formula?

A recurrence relation calculates a term from one or more previous terms, while an nth-term formula calculates it directly from its position. For example, $u{n+1}=un+4$ is recursive because you repeatedly use the current term. The equivalent explicit formula might be $un=u1+4(n-1)$. Recurrence relations highlight how a process changes step by step, whereas explicit formulas are usually more efficient for finding distant terms. Some sequences have simple versions of both forms, but others are much easier to describe recursively.

How do I know whether to start with u0 or u1?

Use the index stated in the question rather than assuming that every sequence begins in the same place. If $u0$ is the initial value, one application of the recurrence produces $u1$. If $u1$ is the initial value, one application produces $u2$. In a contextual problem, define what the starting term represents and when it is measured. A short timeline labelled with the indices can prevent an otherwise correct calculation from being shifted by one interval.

How can I tell whether a recurrence relation is arithmetic or geometric?

An arithmetic sequence adds the same amount each time, so its recursive form is $u{n+1}=un+d$. A geometric sequence multiplies by the same ratio each time, giving $u{n+1}=run$. If the rule both multiplies and adds, such as $u{n+1}=0.9un+20$, it is neither a standard arithmetic nor a standard geometric sequence. You can confirm the classification by generating several terms and checking consecutive differences or ratios. Recognising the operation is more reliable than deciding from the appearance of the numbers alone.

How do I find the limit of a linear recurrence relation?

For $u{n+1}=run+c$, assume the sequence approaches a limit $L$ and set $L=rL+c$. Solving gives $L=c/(1-r)$ when $r\ne1$. For the standard first-order linear case, the sequence converges toward that fixed point when $|r| 1$, small differences from the fixed point generally grow instead of shrinking. You should therefore check the multiplier and the behaviour of several terms rather than treating every solution of $L=f(L)$ as an attained limit.

What is the best way to revise recurrence relations for an IB exam?

Begin by translating every recurrence into an instruction using words such as multiply, add, subtract, and repeat. Next, practise generating three or four terms while paying close attention to the starting index. Then connect additive recurrences to arithmetic sequences and multiplicative recurrences to geometric sequences. Include contextual questions in which you must decide whether a percentage change occurs before or after a deposit, dose, or other fixed adjustment. Finally, use timed Questionbank practice and review each error as either a translation, indexing, arithmetic, technology, or interpretation mistake.

Back to all posts

Why do recurrence relations feel harder than they need to be?

Q: Can I use my calculator for recurrence relations in IB Maths?

Technology use depends on the IB mathematics course and paper. Current Mathematics: Applications and Interpretation external papers allow technology, so repeated iteration can be performed efficiently on an approved calculator. Mathematics: Analysis and Approaches Paper 1 does not allow technology, while Paper 2 does. Even when using a calculator, write the initial condition and recurrence clearly and show enough reasoning to make your method understandable. You should also know how to generate the first few terms manually because this exposes indexing and modelling errors.

Emma C.

• 29 Jul 2026•15

Why do recurrence relations feel harder than they need to be?

Join 650k+ students breezing through the IBReady to breeze through the IB?

Why do recurrence relations feel harder than they… | RevisionDojo

Back to all posts

Why do recurrence relations feel harder than they need to be?

Emma C.

• 29 Jul 2026•15

Recurrence relations feel harder than they need to be because the notation hides a simple repeated process. Instead of giving a term directly from its position, a recurrence relation tells you how to transform one term into the next. Once you read it as an instruction such as multiply the current value, then add a fixed amount, most questions become systematic.

For IB students, the essential skill is not advanced recurrence theory. It is recognising the repeated operation, using the correct initial value, tracking the index carefully, and deciding whether the pattern is arithmetic, geometric, or a combination of multiplication and addition. This explainer focuses on that single skill rather than duplicating the wider coverage in RevisionDojo's IB Maths AA Number and Algebra Explained for Exams.

What is a recurrence relation?

A recurrence relation defines each new term of a sequence using one or more earlier terms. A typical first-order relation looks like

$u_{n+1}=f(u_n)$ ,

where $u_n$ is the current term and $u_{n+1}$ is the next term. The relation must normally be accompanied by an initial value, such as $u_1=5$ , because the rule cannot begin without a starting point.

For example,

$u_1=5, \quad u_{n+1}=2u_n+3$

means:

Start with 5.
Multiply the current term by 2.
Add 3.
Repeat to obtain the next term.

This gives

$u_2=2(5)+3=13$ ,

$u_3=2(13)+3=29$ ,

$u_4=2(29)+3=61$ .

The notation is compact, but the underlying instruction is elementary. A recurrence relation is therefore best understood as a repeatable process, not as an equation that must immediately be rearranged or solved.

Why recurrence relations feel unnecessarily difficult

Several small difficulties appear at the same time, making the topic seem more complicated than it is.

The formula does not give the answer directly

An explicit formula such as

$u_n=3n+2$

allows you to substitute $n=20$ and calculate $u_{20}$ immediately. A recurrence relation such as

$u_{n+1}=u_n+3$

normally requires you to move from one term to the next, unless you first identify and write an equivalent explicit formula.

Students are often uncomfortable because they expect every sequence formula to contain a usable value of $n$ . A recursive rule answers a different question: How does the sequence change from one step to the next?

The subscripts look like algebraic operations

In $u_{n+1}=0.8u_n+12$ , the expression $n+1$ is an index. It identifies the next term; it does not mean that is multiplied by .

A useful translation is:

Symbol	Meaning
$u_n$	current term
$u_{n+1}$	next term
$u_{n-1}$

Replacing the symbols mentally with current and next removes much of the apparent abstraction.

Different questions use different starting indices

Some sequences begin with $u_0$ , while others begin with $u_1$ . Neither convention is inherently better, but changing the starting index shifts every later label.

If $u_0=10$ , then applying the rule once produces $u_1$ . If $u_1=10$ , applying it once produces . This is one of the most common sources of one-step errors in recurrence relations sequences.

Context can hide the order of operations

A savings balance may earn interest and then receive a deposit. A medicine concentration may decay and then receive another dose. Both situations can produce a rule of the form

$u_{n+1}=ru_n+c$ ,

but the value of $c$ and its placement depend on when the transaction occurs. The mathematics becomes much easier once the timeline is made explicit.

The pattern-recognition shortcut

For the most common school-level recurrence relation

$u_{n+1}=ru_n+c$ ,

read the right-hand side in this order:

old value → multiply by $r$ → add $c$ → new value

This is the central shortcut. It turns symbolic notation into a small machine through which each value passes.

Recurrence	Repeated instruction	Pattern type
$u_{n+1}=u_n+d$	Add $d$

This classification matters because it connects unfamiliar recurrence notation to sequence patterns you already know. The current IB Mathematics courses place arithmetic and geometric sequences in Topic 1: Number and algebra. The detailed course content emphasises nth-term and sum formulas, applications, and financial mathematics; general methods for solving arbitrary recurrence relations are not presented as a separate core subtopic in the current guides.

You should therefore distinguish between an official requirement and a useful perspective. Recognising $u_{n+1}=u_n+d$ as arithmetic or $u_{n+1}=ru_n$ as geometric directly supports IB sequence work. More general relations such as are valuable for modelling and iteration, but you should follow your teacher's guidance about the precise scope expected for your course and examination session.

How to generate terms without losing the pattern

Use a four-step routine whenever you are asked to find successive terms.

Step 1: Circle the initial value

Suppose

$u_0=40, \quad u_{n+1}=0.75u_n+8$ .

The first input is 40. Because it is labelled $u_0$ , one application of the rule gives $u_1$ .

Step 2: State the operation in words

The rule says: keep 75% of the current value, then add 8. This verbal statement is easier to monitor than repeatedly rereading the notation.

Step 3: Substitute the complete current term

$u_1=0.75(40)+8=38$

$u_2=0.75(38)+8=36.5$

$u_3=0.75(36.5)+8=35.375$

Always substitute the previous answer into the position occupied by $u_n$ . Do not substitute the index $n$ there.

Step 4: Check whether the movement is reasonable

The values decrease from 40, but the fixed addition of 8 prevents them from simply shrinking toward zero. This qualitative check can expose a missing addition, an incorrect percentage multiplier, or premature rounding.

For calculator-supported work, store the previous answer and repeatedly evaluate the same operation. In Mathematics: Applications and Interpretation, technology is allowed in both external examination papers according to the current official IB subject brief. In Mathematics: Analysis and Approaches, Paper 1 does not allow technology, while Paper 2 does, so written substitution remains important.

How recurrence relations connect to familiar sequences

Arithmetic sequences are additive recurrences

An arithmetic sequence has a constant difference $d$ . Recursively, it can be written as

$u_{n+1}=u_n+d$ .

If $u_1=a$ , the equivalent explicit formula is

$u_n=a+(n-1)d$ .

For example, $u_1=7$ and $u_{n+1}=u_n+4$ produce . Recognising the constant addition lets you replace repeated calculation with the standard arithmetic nth-term formula when a distant term is required.

Geometric sequences are multiplicative recurrences

A geometric sequence has a constant ratio $r$ . Its recursive form is

$u_{n+1}=ru_n$ ,

and, if $u_1=a$ , its explicit form is

$u_n=ar^{n-1}$ .

For example, $u_1=200$ and $u_{n+1}=1.05u_n$ describe 5% growth per step. The multiplier is , not 0.05, because the new amount contains the original 100% plus an additional 5%.

RevisionDojo's IB Maths AI sequences and sigma notation resources and geometric sequences questionbank provide focused practice on these two patterns. Students taking AA can use the corresponding arithmetic sequences and series resources.

How to build a recurrence relation from words

Writing the model is usually harder than iterating it. Separate the context into three components:

State variable: What does $u_n$ represent?
Repeated change: What happens during one interval?
Timing: Does the fixed addition or subtraction occur before or after the percentage change?

Suppose a tank contains 500 litres of water. At the end of each day, 20% of the water is lost and then 30 litres are added. If $u_n$ is the volume immediately after the addition on day $n$ , then 80% remains before the next addition:

$u_{n+1}=0.8u_n+30$ .

If instead 30 litres are added first and 20% of the resulting amount is then lost, the model becomes

$u_{n+1}=0.8(u_n+30)$ ,

which is equivalent to $u_{n+1}=0.8u_n+24$ . The two models are not interchangeable because the events occur in a different order.

A strong exam response defines the variable and its timing, for example: “Let $u_n$ be the volume in litres immediately after the addition on day $n$ .” This single sentence makes the recurrence and initial condition much less ambiguous.

The steady-state shortcut

For a recurrence of the form

$u_{n+1}=ru_n+c$ ,

a steady state or fixed point is a value that remains unchanged after the rule is applied. If the sequence approaches a limit $L$ , then both the current and next values approach $L$ , so

$L=rL+c$ .

Therefore,

$L=\frac{c}{1-r}, \quad r\ne1$ .

For $u_{n+1}=0.75u_n+8$ ,

$L=0.75L+8$ ,

$0.25L=8$ ,

$L=32$ .

This explains why the earlier sequence $40,38,36.5,35.375,\ldots$ moves toward 32. The shortcut is not merely algebraic: at 32, keeping 75% gives 24 and adding 8 restores 32.

For this simple linear recurrence, convergence toward the fixed point occurs when $|r|<1$ . If $r$ lies between 0 and 1, values generally approach the limit from one side. If $-1<r<0$ , they may alternate around it, while $∣ r ∣ > 1$ generally causes deviations from the fixed point to grow.

Do not assume that every recurrence has a limit. Before solving $L=f(L)$ , inspect the generated terms and the multiplier. A fixed-point equation identifies possible unchanged values, but additional reasoning is needed to decide whether the sequence actually approaches one.

Common exam mistakes and how to prevent them

Using the wrong percentage multiplier

A 7% increase means multiply by 1.07. A 7% decrease means multiply by 0.93. Writing 0.07 keeps only 7% of the original value rather than increasing it by 7%.

Ignoring the initial condition

The recurrence rule alone usually defines many possible sequences. The initial condition selects the particular sequence required by the question.

Confusing a term with a sum

$u_n$ denotes an individual term, whereas $S_n$ commonly denotes the sum of the first $n$ terms. A recurrence that models an account balance is not automatically asking for the sum of all previous balances.

Rounding every intermediate term

Repeated rounding can compound across many iterations. Keep full calculator precision during the process and round only the final answer unless the question explicitly instructs otherwise.

Reporting an index instead of a real-world time

If $u_0$ represents the starting amount, then $u_{12}$ occurs after 12 intervals. If $u_1$ represents the starting amount, 12 intervals later is . Write a short index timeline before calculating.

Giving calculator output without a model

Even when technology is allowed, show the recurrence, the initial value, and enough substitution or explanation to communicate the method. The IB Maths AI Questionbank is useful for practising this balance between efficient calculator use and visible mathematical reasoning.

A practical revision method

Practise recurrence relations in three passes:

Translation: Rewrite each rule as a verbal instruction.
Execution: Generate three or four terms accurately.
Recognition: Decide whether the process is arithmetic, geometric, or multiply-then-add.

After that, practise modelling from contexts such as depreciation, repeated deposits, population change, cooling, and medication dosage. For each question, define what $u_n$ measures and when it is measured before writing any equation.

Use RevisionDojo's sequences and series revision approach to review formulas through active recall, then move to targeted Questionbank problems. Jojo AI can help diagnose an indexing error or explain why a proposed recurrence does not match the order of events, but you should still write out the first transition yourself.

Conclusion

Recurrence relations feel difficult mainly because compact notation disguises a repeated operation. Read $u_n$ as the current value, $u_{n+1}$ as the next value, and translate $u_{n+1}=ru_n+c$ into .

From there, check the initial index, preserve the order of events, and connect constant addition to arithmetic sequences and constant multiplication to geometric sequences. RevisionDojo Study Notes and Flashcards can reinforce the notation, while the Questionbank and Jojo AI are most useful for practising modelling, iteration, and exam-style interpretation.

Sources and referenced URLs

Add as a preferred source on Google