Arithmetic progression

LVL: FREE

MODULE: Pre-Calculus (Functions and Series)

[EXEC: MICRO_CORE]

✖️ 1. Defining arithmetic sequences via recursive definition and finding the common difference

🔁 Recursive Definition & Common Difference

  • An arithmetic sequence adds the same number to get the next term.
  • The recursive rule is an=an1+da_n = a_{n-1} + d where dd is the common difference.
  • To find dd, subtract any term from the next term: d=anan1d = a_n - a_{n-1}.
  • If d>0d > 0 the sequence increases; if d<0d < 0 it decreases.
  • The common difference stays constant throughout the entire sequence.

Example: Sequence 3, 7, 11, 15 has d=73=4d = 7 - 3 = 4, so an=an1+4a_n = a_{n-1} + 4.

💡 Think: Each step climbs (or drops) by the same fixed amount every time.

[EXEC: DEEP_COMPUTE]

1. Defining arithmetic sequences via recursive definition and finding the common difference

Arithmetic Sequences and the Common Difference

An arithmetic sequence is a sequence where each term after the first is obtained by adding a fixed constant to the previous term. This recursive relationship is expressed as an=an1+da_n = a_{n-1} + d, where dd is the common difference.

Intuition: Each step forward in the sequence involves the same additive jump, creating a uniform pattern of growth or decay.

Core Rules:

  • The common difference d=anan1d = a_n - a_{n-1} for any consecutive terms.
  • If d>0d > 0, the sequence is increasing; if d<0d < 0, it is decreasing; if d=0d = 0, all terms are identical.
  • The recursive formula requires knowing the previous term to compute the next.
  • The sequence is fully determined by the first term a1a_1 and the common difference dd.

Consequence: The common difference characterizes the entire sequence's behavior and rate of change.

Example: In the sequence 3,7,11,15,3, 7, 11, 15, \ldots, we have d=73=4d = 7 - 3 = 4, so an=an1+4a_n = a_{n-1} + 4.

TASK_1[0 / 3]
LVL_2
RSN: PATTERN

Find the common difference dd for the following arithmetic sequence:

12,5,2,9,12, 5, -2, -9, \dots

DEEP_COMPUTE
ULTRA
[EXEC: MICRO_CORE]

✖️ 2. Linking arithmetic sequences to linear models

📈 Connection to Linear Models

  • An arithmetic sequence is a discrete linear function where nn is the input.
  • The common difference dd acts as the slope of the line.
  • The first term a1a_1 acts as the y-intercept (when n=1n = 1).
  • Graphing term number vs. term value produces evenly spaced points on a straight line.
  • This connects algebra (sequences) to geometry (linear graphs).

Example: Sequence 5, 8, 11, 14 has slope d=3d = 3; plotting (1,5), (2,8), (3,11), (4,14) forms a line.

💡 Visual: Dots marching up (or down) a perfectly straight staircase.

[EXEC: DEEP_COMPUTE]

2. Linking arithmetic sequences to linear models

Arithmetic Sequences as Linear Functions

An arithmetic sequence corresponds to a discrete linear function where the term number nn acts as the independent variable and the term value ana_n as the dependent variable. The common difference dd is precisely the slope of this linear relationship.

Intuition: Plotting the terms (n,an)(n, a_n) yields points lying on a straight line, revealing the sequence's linear structure.

Core Rules:

  • The relationship an=a1+(n1)da_n = a_1 + (n-1)d mirrors the slope-intercept form y=mx+by = mx + b, where slope m=dm = d.
  • The slope dd measures the rate of change per unit increase in nn.
  • The yy-intercept analogue is a1da_1 - d (the value when n=0n = 0 is extrapolated).
  • This connection allows applying linear modeling techniques to sequence problems.

Consequence: Arithmetic sequences are linear models in discrete settings, enabling graphical and algebraic analysis using familiar tools from coordinate geometry.

Example: For an=5+3(n1)a_n = 5 + 3(n-1), the slope is 33, matching the common difference.

TASK_1[0 / 3]
LVL_2
EXEC: FORMULA

An arithmetic sequence is defined by the formula an=7+4(n1)a_n = 7 + 4(n-1).

If this sequence is graphed as a discrete linear function where nn is the independent variable, what is the slope of the line?

DEEP_COMPUTE
ULTRA
[EXEC: MICRO_CORE]

✖️ 3. Using the explicit formula for the n-th term

🎯 Explicit Formula for the n-th Term

  • The explicit formula is an=a1+(n1)da_n = a_1 + (n - 1)d where a1a_1 is the first term.
  • This lets you jump directly to any term without computing all previous terms.
  • The factor (n1)(n - 1) counts how many steps of size dd you take from a1a_1.
  • Plug in nn, a1a_1, and dd to calculate ana_n instantly.
  • Use this formula when you need a specific term far into the sequence.

Example: For a1=2a_1 = 2 and d=5d = 5, the 10th term is a10=2+(101)5=2+45=47a_{10} = 2 + (10 - 1) \cdot 5 = 2 + 45 = 47.

💡 Shortcut: Start + (steps × step-size) = destination.

[EXEC: DEEP_COMPUTE]

3. Using the explicit formula for the n-th term

Explicit Formula for the nn-th Term

The explicit formula an=a1+(n1)da_n = a_1 + (n-1)d directly computes the nn-th term of an arithmetic sequence without requiring prior terms. Here, a1a_1 is the first term, dd is the common difference, and nn is the term position.

Intuition: To reach the nn-th term, we start at a1a_1 and add the common difference (n1)(n-1) times, since there are (n1)(n-1) steps from term 1 to term nn.

Core Rules:

  • The formula applies for any positive integer nn.
  • Direct computation: No need for recursion; any term is accessible immediately.
  • Rearranging gives d=ana1n1d = \frac{a_n - a_1}{n - 1} when dd is unknown.
  • If a1a_1 and ana_n are known along with nn, we can solve for dd.

Consequence: The explicit formula is computationally efficient and essential for solving problems involving distant terms.

Example: For a1=2a_1 = 2, d=5d = 5, the 10th term is a10=2+(101)5=47a_{10} = 2 + (10-1) \cdot 5 = 47.

TASK_1[0 / 3]
LVL_2
EXEC: FORMULA

An arithmetic sequence has a first term a1=5a_1 = 5 and a common difference d=3d = 3.

Calculate the 12th term of this sequence.

DEEP_COMPUTE
ULTRA
[EXEC: MICRO_CORE]

✖️ 4. Defining an arithmetic series and deriving the sum formula

➕ Arithmetic Series & Sum Formula

  • An arithmetic series is the sum of terms in an arithmetic sequence.
  • The sum of the first nn terms is Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n).
  • This formula works by pairing first and last terms, which all sum to the same value.
  • You can also write it as Sn=n2[2a1+(n1)d]S_n = \frac{n}{2}[2a_1 + (n - 1)d] using only a1a_1 and dd.
  • Multiply the average of first and last term by the number of terms.

Example: Sum of 2, 5, 8, 11, 14 (5 terms) is S5=52(2+14)=5216=40S_5 = \frac{5}{2}(2 + 14) = \frac{5}{2} \cdot 16 = 40.

💡 Trick: (First + Last) ÷ 2 × Count = Total.

[EXEC: DEEP_COMPUTE]

4. Defining an arithmetic series and deriving the sum formula

Arithmetic Series and the Sum Formula

An arithmetic series is the sum of the first nn terms of an arithmetic sequence. The sum formula is Sn=n2(a1+an)S_n = \frac{n}{2}(a_1 + a_n), where SnS_n denotes the sum, nn is the number of terms, a1a_1 is the first term, and ana_n is the last term.

Intuition: Pairing terms symmetrically from the ends yields n/2n/2 pairs, each summing to a1+ana_1 + a_n, giving the total sum.

Core Rules:

  • Alternative form: Sn=n2[2a1+(n1)d]S_n = \frac{n}{2}[2a_1 + (n-1)d] when ana_n is not directly known.
  • The formula requires knowing nn, a1a_1, and either ana_n or dd.
  • Derivation: Write SnS_n forward and backward, add term-by-term to get 2Sn=n(a1+an)2S_n = n(a_1 + a_n).
  • The sum grows quadratically in nn when d0d \neq 0.

Consequence: The sum formula enables efficient computation of cumulative totals without adding terms individually.

Example: For a1=3a_1 = 3, a5=15a_5 = 15, n=5n = 5: S5=52(3+15)=45S_5 = \frac{5}{2}(3 + 15) = 45.

TASK_1[0 / 3]
LVL_2
EXEC: FORMULA

Find the sum of the first 1010 terms of an arithmetic sequence where the first term is 55 and the 10th term is 4141.

DEEP_COMPUTE
ULTRA
[EXEC: MICRO_CORE]

✖️ 5. Applications in depreciation and kinematics

🛠️ Real-World Applications

  • Straight-line depreciation: An asset loses the same dollar value each year.
  • If a machine costs 10000 dollars and depreciates 1000 dollars yearly, value after nn years is 100001000n10000 - 1000n.
  • Uniform acceleration: Velocity increases by the same amount each second in physics.
  • If a car starts at 5 m/s and accelerates 2 m/s every second, velocity at second nn is 5+2(n1)5 + 2(n - 1).
  • Both scenarios use the explicit formula an=a1+(n1)da_n = a_1 + (n - 1)d with real units.

Example: A laptop worth 1200 dollars depreciates 150 dollars/year; after 4 years: 12001504=6001200 - 150 \cdot 4 = 600 dollars.

💡 Remember: Constant change over time = arithmetic progression in action.

[EXEC: DEEP_COMPUTE]

5. Applications in depreciation and kinematics

Applications: Depreciation and Uniform Acceleration

Arithmetic progressions model real-world scenarios involving constant rate changes. In accounting, straight-line depreciation reduces an asset's value by a fixed amount dd each period. In kinematics, uniform acceleration changes velocity by a constant increment per time unit.

Intuition: When a quantity changes by the same amount repeatedly, an arithmetic sequence naturally describes its evolution over time.

Core Rules:

  • Depreciation: If an asset starts at value V0V_0 and depreciates by dd dollars annually, its value after nn years is Vn=V0ndV_n = V_0 - nd.
  • Kinematics: With initial velocity v0v_0 and constant acceleration aa, velocity at time tnt_n is vn=v0+nav_n = v_0 + na (discrete time steps).
  • Both applications use the explicit formula structure an=a1+(n1)da_n = a_1 + (n-1)d.
  • The common difference represents the rate of change (depreciation rate or acceleration).

Consequence: Recognizing arithmetic patterns simplifies financial and physical predictions.

Example: An asset worth 10000 dollars depreciating 500 dollars yearly has value 100005500=750010000 - 5 \cdot 500 = 7500 dollars after 5 years.

TASK_1[0 / 3]
LVL_2
EXEC: FORMULA

A delivery van is purchased for 35000 dollars. It undergoes straight-line depreciation, losing 2500 dollars in value each year. What is the value of the van, in dollars, after 4 years?

DEEP_COMPUTE
ULTRA

AWAITING_CONFIRMATION

CONFIRM KNOWLEDGE ACQUISITION TO UPDATE SYSTEM ANALYTICS.