Explicit and recursive descriptions

Textbook reading

The problem that opens the lesson

A sequence begins $3,8,18,38,78$ . Write a recurrence and an explicit formula.

Solution

Begin by identifying the mathematical object and the information that fixes it. Generate several terms, identify the repeated operation, propose both forms when possible, and verify that they agree on multiple indices. The relevant conditions are not optional bookkeeping: Not every recursion has an elementary explicit formula, and not every finite term list determines a unique rule. Following that structure gives Recurrence $a_n=2a_{n-1}+2$ ; explicit $a_n=5\cdot 2^{n-1}-2$ for $n\ge 1$ .

Why this works

An initial condition is essential because the same recurrence can generate infinitely many sequences from different starting values. The calculation and the representation should agree, so a graph, diagram, table, or substitution check should support the same conclusion.

Textbook reading

What this lesson is really about

An explicit rule computes a_n directly from n, while a recursive rule computes a term from earlier terms and initial conditions.

Recursion mirrors repeated processes and can describe patterns without a simple closed form. Explicit rules make distant terms easier to evaluate.

The point is not merely to reproduce a formula. A learner should be able to identify the quantities or geometric objects involved, explain why the relationship has its stated form, and recognize when the same idea appears in a graph, table, diagram, or model.

Textbook reading

Why the relationship works

An initial condition is essential because the same recurrence can generate infinitely many sequences from different starting values.

Textbook reading

A reliable way to work

Generate several terms, identify the repeated operation, propose both forms when possible, and verify that they agree on multiple indices.

Not every recursion has an elementary explicit formula, and not every finite term list determines a unique rule.

After the symbolic work is complete, check the result. Depending on the lesson, this may mean substituting into an original equation, comparing coordinates, examining a graph, checking units, testing an interval, or confirming that every branch of a periodic solution has been included.

Textbook reading

What commonly goes wrong

A common error is writing a recurrence without a starting term or using $a_0$ and $a_1$ inconsistently.

The repair is to return to the definition and identify the first step where the invalid solution stops describing the original mathematical object. Later algebra cannot rescue a first step that changed the domain, orientation, branch, or meaning of the problem.

Textbook reading

Worked examples

Worked example 1

A sequence begins $3,8,18,38,78$ . Write a recurrence and an explicit formula.

Solution

Begin by identifying the mathematical object and the information that fixes it. Generate several terms, identify the repeated operation, propose both forms when possible, and verify that they agree on multiple indices. The relevant conditions are not optional bookkeeping: Not every recursion has an elementary explicit formula, and not every finite term list determines a unique rule. Following that structure gives Recurrence $a_n=2a_{n-1}+2$ ; explicit $a_n=5\cdot 2^{n-1}-2$ for $n\ge 1$ .

Why this works

An initial condition is essential because the same recurrence can generate infinitely many sequences from different starting values. The calculation and the representation should agree, so a graph, diagram, table, or substitution check should support the same conclusion.

Transfer example

Problem

Recover a recursion from an explicit arithmetic formula.

Worked development

Generate several terms, identify the repeated operation, propose both forms when possible, and verify that they agree on multiple indices. In this example, the first useful move is to make the defining structure visible rather than to search for a memorized answer. Recursion mirrors repeated processes and can describe patterns without a simple closed form. Explicit rules make distant terms easier to evaluate. Then apply the conditions explicitly: Not every recursion has an elementary explicit formula, and not every finite term list determines a unique rule. Finish by checking the result in a second representation and explaining what the result means.

Interpretation

Explicit-recursive translation supports algorithms, finance, population models, and discrete dynamics.

Reasoning example

Problem

Iterate a nonlinear recurrence.

Worked development

Generate several terms, identify the repeated operation, propose both forms when possible, and verify that they agree on multiple indices. In this example, the first useful move is to make the defining structure visible rather than to search for a memorized answer. Recursion mirrors repeated processes and can describe patterns without a simple closed form. Explicit rules make distant terms easier to evaluate. Then apply the conditions explicitly: Not every recursion has an elementary explicit formula, and not every finite term list determines a unique rule. Finish by checking the result in a second representation and explaining what the result means.

Interpretation

Explicit-recursive translation supports algorithms, finance, population models, and discrete dynamics.

Worked example 4: quick check

Why is $a_{n}=2a_{n-1}$ incomplete as a sequence definition?

Solution

Begin by identifying the mathematical object and the information that fixes it. Generate several terms, identify the repeated operation, propose both forms when possible, and verify that they agree on multiple indices. The relevant conditions are not optional bookkeeping: Not every recursion has an elementary explicit formula, and not every finite term list determines a unique rule. Following that structure gives An initial term is needed.

Why this works

An initial condition is essential because the same recurrence can generate infinitely many sequences from different starting values. The calculation and the representation should agree, so a graph, diagram, table, or substitution check should support the same conclusion.

Textbook reading

Application and interpretation

Explicit-recursive translation supports algorithms, finance, population models, and discrete dynamics.

A contextual answer must include units, a meaningful domain, and the assumptions that make the model plausible. An exact mathematical relationship should not be diluted into a decimal unless a measurement or comparison requires it.

Practice