Study guide
7.3 Arithmetic Progressions (AP), General Term, Sum of n Terms & Sequence Modeling
RRB Section Controller 2026: Free Written CBT Study Guide Exam
Track your progress as you read
Finished sections get a check mark.
1 Chapter 1: Exam Overview & Operational Profile
1.1 Written CBT Pattern, Scoring & Selection 1.2 Eligibility, Documents & A-2 Medical Requirements
2 Chapter 2: Number Systems & Arithmetic Foundations
2.1 Number Systems, Divisibility Rules, Prime Factorization & Remainder Theorem 2.2 Unit Digits, Cyclicity Rules & Power Modulo Calculations 2.3 HCF and LCM Properties, Prime Factorization & Practical Word Problems 2.4 Fractions, Decimals, Surds, Indices & BODMAS Simplification
3 Chapter 3: Commercial Arithmetic: Percentages, Profit & Rates
3.1 Percentages, Fractional Equivalents, Successive Variations & Population Formulas 3.2 Cost Price, Selling Price, Profit/Loss Percentage, Dishonest Dealer & Discount Schemes 3.3 Simple Interest, Compound Interest Formulas, Annual/Semi-Annual Compounding & Difference Traps
4 Chapter 4: Ratios, Proportions, Mixtures & Partnerships
4.1 Ratios, Duplicate/Sub-Duplicate Ratios, Direct and Inverse Variations & Proportional Sharing 4.2 Averages, Change in Average, Batsman/Bowling Averages & Replacement Problems 4.3 Rule of Alligation, Removal-Replacement Mixtures & Partnership Capital-Time Sharing
5 Chapter 5: Motion Dynamics, Time, Distance & Train Logistics
5.1 Time, Speed, Distance Relations, Average Speed & Unit Conversions 5.2 Train Problems: Passing Poles, Platforms, Moving Objects & Relative Speed in Opposite/Same Directions 5.3 Upstream, Downstream Boat Velocity, Still Water Speed & Circular Track Races
6 Chapter 6: Work Efficiency, Pipes & Operational Scheduling
6.1 Individual and Group Work, Efficiency Ratios, Work Equivalences & Mandays Formula 6.2 Alternate Day Working, Negative Work & Wage Distribution Based on Work Done 6.3 Inlet and Outlet Pipes, Net Filling Rate, Alternating Flow & Tank Leakage Problems
7 Chapter 7: Algebra, Linear Equations & Progressions
7.1 Algebraic Identities, Polynomial Factorization & Systems of Linear Equations in Two Variables 7.2 Quadratic Equations, Nature of Roots, Discriminant Analysis & Maximum/Minimum Values 7.3 Arithmetic Progressions (AP), General Term, Sum of n Terms & Sequence Modeling
8 Chapter 8: Mensuration: 2D Areas & 3D Solids
8.1 Lines, Angles, Triangle Theorems, Congruence/Similarity & Circle Tangent Properties 8.2 Perimeter and Area of Quadrilaterals, Polygons, Circles & Shaded Region Problems 8.3 Surface Area and Volume of Cubes, Cuboids, Cylinders, Cones, Spheres & Melting-Recasting Solids
9 Chapter 9: Statistics, Probability & Data Interpretation
9.1 Mean, Median, Mode, Range, Mean Deviation & Standard Deviation 9.2 Permutations, Combinations, Classical Probability, Independent Events & Odds 9.3 Tabular Data Interpretation, Bar Charts, Grouped Graphs & Percentage Calculation Shortcuts 9.4 Pie Charts (Angle vs Percentage), Line Trend Graphs & Quantitative Data Sufficiency
10 Chapter 10: Multi-Source & Graphical Analysis
10.1 Multi-Source Analysis, Set Data & Arrangement 10.2 Scatter Plots, Histograms & Distribution Curves
11 Chapter 11: Deductive Logic, Statements & Binary Puzzles
11.1 Syllogisms, Sets & Possibility Conclusions 11.2 Critical Reasoning: Implicit Assumptions, Strong vs Weak Arguments & Course of Action 11.3 Binary Logic: Truth-Tellers, Liars, Alternators & Matrix Logic Deductions
12 Chapter 12: Relational, Directional, Clock & Calendar Reasoning
12.1 Direct Family Relations, Coded Blood Relations & Family Tree Tree-Mapping Methods 12.2 Cardinal & Ordinal Directions, Multi-Step Turn Paths, Pythagorean Distance & Shadow Timing 12.3 Clock Hands Angular Speed, Angle Between Hands at Given Time, Coincidence & Faulty Clocks 12.4 Odd Days Concept, Reference Date Calculations, Leap Year Rules & Repeating Calendar Years
13 Chapter 13: English Reading Comprehension
13.1 English Comprehension: Main Idea, Support & Inference 13.2 English Comprehension: Application, Structure & Style
14 Chapter 14: Mental Reasoning: Analogies & Series
14.1 Semantic, Letter & Number Analogies 14.2 Number Series: Differences, Powers & Missing Terms 14.3 Interleaved, Recursive & Wrong-Term Series
15 Chapter 15: Mental Reasoning: Coding & Ranking
15.1 Letter Shifts, Reversal & Numerical Codes 15.2 Message Intersections & Conditional Coding Tables 15.3 Ranking, People Between & Position Interchanges
16 Chapter 16: Mental Reasoning: Seating Arrangements
16.1 Linear Seating & Parallel Rows 16.2 Circular Seating, Facing & Rotational Symmetry
7.3 Arithmetic Progressions (AP), General Term, Sum of n Terms & Sequence Modeling
Key Takeaways Explain This Topic AI
An Arithmetic Progression (AP) is governed by a constant difference d = a k − a k − 1 d = a_k - a_{k-1} d = a k − a k − 1 ; its general n n n -th term is T n = a + ( n − 1 ) d T_n = a + (n-1)d T n = a + ( n − 1 ) d , and the n n n -th term from the end of a finite AP of length m m m with last term l l l is l − ( n − 1 ) d l - (n-1)d l − ( n − 1 ) d .
The sum of the first n n n terms is S n = n 2 [ 2 a + ( n − 1 ) d ] = n 2 ( a + l ) S_n = \frac{n}{2}[2a + (n-1)d] = \frac{n}{2}(a + l) S n = 2 n [ 2 a + ( n − 1 ) d ] = 2 n ( a + l ) ; the general term can always be extracted via the backward difference T n = S n − S n − 1 T_n = S_n - S_{n-1} T n = S n − S n − 1 .
If the sum of n n n terms is quadratic in n n n ( S n = A n 2 + B n S_n = An^2 + Bn S n = A n 2 + B n ), the sequence is strictly an AP with common difference d = 2 A d = 2A d = 2 A and first term a = A + B a = A + B a = A + B .
Inserting n n n arithmetic means between a a a and b b b creates an AP of ( n + 2 ) (n+2) ( n + 2 ) terms with common difference d = b − a n + 1 d = \frac{b-a}{n+1} d = n + 1 b − a ; the sum of all n n n inserted means equals n × a + b 2 n \times \frac{a+b}{2} n × 2 a + b .
Symmetric term representations drastically reduce calculation complexity: choose 3 terms as ( a − d , a , a + d ) (a-d, a, a+d) ( a − d , a , a + d ) with sum 3 a 3a 3 a , 4 terms as ( a − 3 d , a − d , a + d , a + 3 d ) (a-3d, a-d, a+d, a+3d) ( a − 3 d , a − d , a + d , a + 3 d ) with common difference 2 d 2d 2 d and sum 4 a 4a 4 a , and 5 terms as ( a − 2 d , a − d , a , a + d , a + 2 d ) (a-2d, a-d, a, a+d, a+2d) ( a − 2 d , a − d , a , a + d , a + 2 d ) with sum 5 a 5a 5 a .
Last updated: October 2026
Definition & Fundamental Parameters of an AP
An Arithmetic Progression (AP) is a sequence of real numbers in which each term after the first is obtained by adding a fixed constant, called the common difference ( d d d ), to the preceding term. General Sequence: a , a + d , a + 2 d , a + 3 d , … , a + ( n − 1 ) d \text{General Sequence: } a, \; a+d, \; a+2d, \; a+3d, \; \dots, \; a+(n-1)d General Sequence: a , a + d , a + 2 d , a + 3 d , … , a + ( n − 1 ) d
First Term ( a a a ): The initial value T 1 = a T_1 = a T 1 = a .
Common Difference ( d d d ): The constant difference between any consecutive pair of terms: d = T n − T n − 1 = T 2 − T 1 = T 3 − T 2 d = T_n - T_{n-1} = T_2 - T_1 = T_3 - T_2 d = T n − T n − 1 = T 2 − T 1 = T 3 − T 2
The common difference d d d can be positive (increasing AP, e.g., 4 , 7 , 10 , … 4, 7, 10, \dots 4 , 7 , 10 , … ), negative (decreasing AP, e.g., 20 , 16 , 12 , … 20, 16, 12, \dots 20 , 16 , 12 , … ), or zero (constant sequence, e.g., 5 , 5 , 5 , … 5, 5, 5, \dots 5 , 5 , 5 , … ).
General n n n -th Term Formula
The n n n -th term from the beginning ( T n T_n T n or a n a_n a n ) is given by: T n = a + ( n − 1 ) d T_n = a + (n - 1)d T n = a + ( n − 1 ) d
n n n -th Term from the End of a Finite AP
If a finite AP contains last term l l l and common difference d d d , counting backwards turns the sequence into an AP with first term l l l and common difference − d -d − d : T n ′ = l − ( n − 1 ) d T_n' = l - (n - 1)d T n ′ = l − ( n − 1 ) d
Total Number of Terms ( n n n ) in a Finite AP
If the first term is a a a , the last term is l l l , and the common difference is d d d : l = a + ( n − 1 ) d ⟹ n = l − a d + 1 l = a + (n - 1)d \implies n = \frac{l - a}{d} + 1 l = a + ( n − 1 ) d ⟹ n = d l − a + 1 +-----------------------------------------------------------------------------------------+
- | AP FUNDAMENTAL PARAMETERS OVERVIEW |
- +-----------------------------------------------------------------------------------------+
- | Starting Term: a |
- | Common Difference: d = T_k - T_(k-1) |
- | n-th Term (from start): T_n = a + (n - 1)d |
- | n-th Term (from end): T_n' = l - (n - 1)d |
- | Term Count: n = [(l - a) / d] + 1 |
- | Arithmetic Mean (2 terms): AM = (a + b) / 2 |
- +-----------------------------------------------------------------------------------------+
- Sum of the First n n n Terms ( S n S_n S n )
The sum of the first n n n terms of an AP ( S n = T 1 + T 2 + ⋯ + T n S_n = T_1 + T_2 + \dots + T_n S n = T 1 + T 2 + ⋯ + T n ) is derived using Gauss's summation principle of writing the series forwards and backwards.
Derivation of Sum Formulas S n = a + ( a + d ) + ( a + 2 d ) + ⋯ + ( l − d ) + l S_n = a + (a + d) + (a + 2d) + \dots + (l - d) + l S n = a + ( a + d ) + ( a + 2 d ) + ⋯ + ( l − d ) + l S n = l + ( l − d ) + ( l − 2 d ) + ⋯ + ( a + d ) + a S_n = l + (l - d) + (l - 2d) + \dots + (a + d) + a S n = l + ( l − d ) + ( l − 2 d ) + ⋯ + ( a + d ) + a
Adding both expressions column-by-column yields n n n identical pairs each summing to ( a + l ) (a + l) ( a + l ) : 2 S n = n ( a + l ) ⟹ S n = n 2 ( a + l ) 2S_n = n(a + l) \implies S_n = \frac{n}{2}(a + l) 2 S n = n ( a + l ) ⟹ S n = 2 n ( a + l )
Substituting the last term l = a + ( n − 1 ) d l = a + (n - 1)d l = a + ( n − 1 ) d : S n = n 2 [ 2 a + ( n − 1 ) d ] S_n = \frac{n}{2} \left[ 2a + (n - 1)d \right] S n = 2 n [ 2 a + ( n − 1 ) d ]
Sum Formulation When to Use
S n = n 2 ( a + l ) S_n = \frac{n}{2}(a + l) S n = 2 n ( a + l ) Use when the first term a a a , last term l l l , and term count n n n are directly known.
S n = n 2 [ 2 a + ( n − 1 ) d ] S_n = \frac{n}{2}[2a + (n-1)d] S n = 2 n [ 2 a + ( n − 1 ) d ] Use when the common difference d d d is given instead of the final term.
Recovering T n T_n T n from Sum Function S n S_n S n
The n n n -th term is the marginal difference between consecutive cumulative sums: T n = S n − S n − 1 ( for n ≥ 2 ) , with T 1 = S 1 T_n = S_n - S_{n-1} \quad (\text{for } n \ge 2), \quad \text{with } T_1 = S_1 T n = S n − S n − 1 ( for n ≥ 2 ) , with T 1 = S 1
The Quadratic Form Theorem for AP Sums
If the sum of n n n terms of a sequence is represented as a quadratic polynomial in n n n without a constant term: S n = A n 2 + B n S_n = An^2 + Bn S n = A n 2 + B n
then the sequence is guaranteed to be an Arithmetic Progression with:
Common Difference: d = 2 A d = 2A d = 2 A (twice the coefficient of n 2 n^2 n 2 )
First Term: a = S 1 = A ( 1 ) 2 + B ( 1 ) = A + B a = S_1 = A(1)^2 + B(1) = A + B a = S 1 = A ( 1 ) 2 + B ( 1 ) = A + B
General Term: T n = 2 A n + ( B − A ) T_n = 2An + (B - A) T n = 2 A n + ( B − A )
Important
If an exam question provides S n = 5 n 2 − 3 n S_n = 5n^2 - 3n S n = 5 n 2 − 3 n , you do not need to expand S n − S n − 1 S_n - S_{n-1} S n − S n − 1 . The common difference is immediately d = 2 × 5 = 10 d = 2 \times 5 = 10 d = 2 × 5 = 10 , and the first term is a = 5 − 3 = 2 a = 5 - 3 = 2 a = 5 − 3 = 2 . The sequence is 2 , 12 , 22 , 32 , … 2, 12, 22, 32, \dots 2 , 12 , 22 , 32 , … .
- Arithmetic Mean (AM) & Insertion of Means
- Single Arithmetic Mean between Two Numbers
If three numbers a , M , b a, M, b a , M , b form an AP, then M − a = b − M ⟹ 2 M = a + b M - a = b - M \implies 2M = a + b M − a = b − M ⟹ 2 M = a + b . The middle term M M M is the Arithmetic Mean (AM) : M = a + b 2 M = \frac{a + b}{2} M = 2 a + b
Inserting n n n Arithmetic Means between a a a and b b b
Let A 1 , A 2 , A 3 , … , A n A_1, A_2, A_3, \dots, A_n A 1 , A 2 , A 3 , … , A n be n n n numbers inserted between a a a and b b b such that the sequence: a , A 1 , A 2 , A 3 , … , A n , b a, \; A_1, \; A_2, \; A_3, \; \dots, \; A_n, \; b a , A 1 , A 2 , A 3 , … , A n , b
forms an Arithmetic Progression. This progression contains a total of N = n + 2 N = n + 2 N = n + 2 terms.
The ( n + 2 ) (n+2) ( n + 2 ) -th term is b b b : b = T n + 2 = a + ( n + 2 − 1 ) d = a + ( n + 1 ) d b = T_{n+2} = a + (n + 2 - 1)d = a + (n + 1)d b = T n + 2 = a + ( n + 2 − 1 ) d = a + ( n + 1 ) d
The common difference is therefore: d = b − a n + 1 d = \frac{b - a}{n + 1} d = n + 1 b − a
The k k k -th inserted arithmetic mean A k A_k A k is: A k = a + k ⋅ d = a + k ( b − a n + 1 ) A_k = a + k \cdot d = a + k \left( \frac{b - a}{n + 1} \right) A k = a + k ⋅ d = a + k ( n + 1 b − a )
Sum of all n n n Inserted Means: ∑ k = 1 n A k = n × ( a + b 2 ) = n × ( AM of a and b ) \sum_{k=1}^n A_k = n \times \left( \frac{a + b}{2} \right) = n \times (\text{AM of } a \text{ and } b) k = 1 ∑ n A k = n × ( 2 a + b ) = n × ( AM of a and b ) +-----------------------------------------------------------------------------------------+
- | INSERTION OF n ARITHMETIC MEANS |
- +-----------------------------------------------------------------------------------------+
- | Given endpoints: a and b |
- | Inserted Sequence: a, [A_1, A_2, A_3, ..., A_n], b (Total: n + 2 terms) |
- | |
- | Step 1: Compute Step Size: d = (b - a) / (n + 1) |
- | Step 2: Compute k-th Mean: A_k = a + k * d |
- | Step 3: Sum of all Means: Sum = n * [(a + b) / 2] |
- +-----------------------------------------------------------------------------------------+
- Symmetric Term Selection Strategies
When a problem specifies properties regarding the sum and product of consecutive terms in an AP, choosing variables symmetrically around the center eliminates the common difference d d d upon summation, leaving a single linear equation for a a a .
Number of Terms Symmetric Representation Common Difference Sum of Terms
3 Terms a − d , a , a + d a - d, \; a, \; a + d a − d , a , a + d d d d ( a − d ) + a + ( a + d ) = 3 a (a - d) + a + (a + d) = \mathbf{3a} ( a − d ) + a + ( a + d ) = 3a
4 Terms a − 3 d , a − d , a + d , a + 3 d a - 3d, \; a - d, \; a + d, \; a + 3d a − 3 d , a − d , a + d , a + 3 d 2 d 2d 2 d ∑ = 4 a \sum = \mathbf{4a} ∑ = 4a
5 Terms a − 2 d , a − d , a , a + d , a + 2 d a - 2d, \; a - d, \; a, \; a + d, \; a + 2d a − 2 d , a − d , a , a + d , a + 2 d d d d ∑ = 5 a \sum = \mathbf{5a} ∑ = 5a
6 Terms a − 5 d , a − 3 d , a − d , a + d , a + 3 d , a + 5 d a - 5d, \; a - 3d, \; a - d, \; a + d, \; a + 3d, \; a + 5d a − 5 d , a − 3 d , a − d , a + d , a + 3 d , a + 5 d 2 d 2d 2 d ∑ = 6 a \sum = \mathbf{6a} ∑ = 6a
Warning
The Even-Term Step Size Trap: When using the 4-term symmetric representation ( a − 3 d , a − d , a + d , a + 3 d ) (a - 3d, a - d, a + d, a + 3d) ( a − 3 d , a − d , a + d , a + 3 d ) , the difference between adjacent terms is ( a − d ) − ( a − 3 d ) = 2 d (a - d) - (a - 3d) = 2d ( a − d ) − ( a − 3 d ) = 2 d , not d d d ! If your algebraic solution gives d = 3 d = 3 d = 3 , the true common difference between terms is 2 d = 6 2d = 6 2 d = 6 . Forgetting this factor of 2 is a frequent examination trap.
In the comparison below, the finite GP sum formula requires r ≠ 1 r\ne1 r = 1 ; for r = 1 r=1 r = 1 the sum is n a na na . The geometric mean and AM–GM inequality use nonnegative endpoints a , b a,b a , b . An infinite GP with nonzero first term has sum a / ( 1 − r ) a/(1-r) a / ( 1 − r ) only for ∣ r ∣ < 1 |r|<1 ∣ r ∣ < 1 .
Comparison: Arithmetic Progression vs. Geometric Progression
While an AP grows or diminishes through constant additive increments, a Geometric Progression (GP) evolves via constant multiplicative factors. +-----------------------------------------------------------------------------------------+
- | AP VS. GP ARCHITECTURE |
- +-----------------------------------------------------------------------------------------+
- | Dimension: Arithmetic Progression (AP) Geometric Progression (GP) |
- | Formation Rule: Additive: T_n - T_(n-1) = d Multiplicative: T_n/T_(n-1)=r |
- | General Term: T_n = a + (n - 1)d T_n = a * r^(n - 1) |
- | Sum of n Terms: S_n = (n/2)[2a + (n-1)d] S_n = a(r^n - 1) / (r - 1) |
- | Infinite Series Sum: Diverges (unless a=d=0) S_inf = a / (1 - r) (|r| < 1)|
- | Mean Between a and b: AM = (a + b) / 2 GM = sqrt(ab) |
- | Mean Inequality: AM >= GM |
- +-----------------------------------------------------------------------------------------+
- Worked Examples
- Worked Example 1: Sum of Decreasing AP & Double Answer Interpretation
Problem: How many terms of the arithmetic progression 17 , 15 , 13 , … 17, 15, 13, \dots 17 , 15 , 13 , … must be summed to yield a total sum of 72? Provide a rigorous physical and mathematical explanation for the occurrence of two distinct answers.
Step 1: Identify parameters: First term a = 17 a = 17 a = 17 , common difference d = 15 − 17 = − 2 d = 15 - 17 = -2 d = 15 − 17 = − 2 , target sum S n = 72 S_n = 72 S n = 72 .
Step 2: Set up the sum equation: S n = n 2 [ 2 a + ( n − 1 ) d ] S_n = \frac{n}{2} \left[ 2a + (n - 1)d \right] S n = 2 n [ 2 a + ( n − 1 ) d ] 72 = n 2 [ 2 ( 17 ) + ( n − 1 ) ( − 2 ) ] 72 = \frac{n}{2} \left[ 2(17) + (n - 1)(-2) \right] 72 = 2 n [ 2 ( 17 ) + ( n − 1 ) ( − 2 ) ] 72 = n 2 [ 34 − 2 n + 2 ] = n 2 [ 36 − 2 n ] = n ( 18 − n ) 72 = \frac{n}{2} \left[ 34 - 2n + 2 \right] = \frac{n}{2} [36 - 2n] = n(18 - n) 72 = 2 n [ 34 − 2 n + 2 ] = 2 n [ 36 − 2 n ] = n ( 18 − n )
Step 3: Solve the quadratic equation in n n n : 18 n − n 2 = 72 ⟹ n 2 − 18 n + 72 = 0 18n - n^2 = 72 \implies n^2 - 18n + 72 = 0 18 n − n 2 = 72 ⟹ n 2 − 18 n + 72 = 0
Factor the quadratic: ( n − 6 ) ( n − 12 ) = 0 ⟹ n = 6 or n = 12 (n - 6)(n - 12) = 0 \implies n = 6 \quad \text{or} \quad n = 12 ( n − 6 ) ( n − 12 ) = 0 ⟹ n = 6 or n = 12
Step 4: Explain the duality of solutions:
For n = 6 n = 6 n = 6 : The first 6 terms are 17 , 15 , 13 , 11 , 9 , 7 17, 15, 13, 11, 9, 7 17 , 15 , 13 , 11 , 9 , 7 . Their sum is 17 + 15 + 13 + 11 + 9 + 7 = 72 17 + 15 + 13 + 11 + 9 + 7 = 72 17 + 15 + 13 + 11 + 9 + 7 = 72 .
Terms from n = 7 n = 7 n = 7 to n = 12 n = 12 n = 12 are: 5 , 3 , 1 , − 1 , − 3 , − 5 5, 3, 1, -1, -3, -5 5 , 3 , 1 , − 1 , − 3 , − 5 .
The sum of these additional six terms is: 5 + 3 + 1 + ( − 1 ) + ( − 3 ) + ( − 5 ) = 0 5 + 3 + 1 + (-1) + (-3) + (-5) = 0 5 + 3 + 1 + ( − 1 ) + ( − 3 ) + ( − 5 ) = 0
Because the terms from the 7th to the 12th cancel out symmetrically around zero, the aggregate sum after 12 terms remains exactly 72. Both n = 6 n = 6 n = 6 and n = 12 n = 12 n = 12 are completely valid.
Worked Example 2: Symmetric Term Selection & Cubic Products
Problem: The sum of three consecutive terms in an AP is 33, and the product of the first and the third term is 105. Find the three numbers.
Step 1: Choose symmetric variables: Let the three terms be a − d , a , a + d a - d, \; a, \; a + d a − d , a , a + d .
Step 2: Utilize the sum condition: ( a − d ) + a + ( a + d ) = 33 ⟹ 3 a = 33 ⟹ a = 11 (a - d) + a + (a + d) = 33 \implies 3a = 33 \implies a = 11 ( a − d ) + a + ( a + d ) = 33 ⟹ 3 a = 33 ⟹ a = 11
Step 3: Utilize the product condition: ( a − d ) ( a + d ) = 105 ⟹ a 2 − d 2 = 105 (a - d)(a + d) = 105 \implies a^2 - d^2 = 105 ( a − d ) ( a + d ) = 105 ⟹ a 2 − d 2 = 105
Substitute a = 11 a = 11 a = 11 : 11 2 − d 2 = 105 ⟹ 121 − d 2 = 105 11^2 - d^2 = 105 \implies 121 - d^2 = 105 1 1 2 − d 2 = 105 ⟹ 121 − d 2 = 105 d 2 = 121 − 105 = 16 ⟹ d = ± 4 d^2 = 121 - 105 = 16 \implies d = \pm 4 d 2 = 121 − 105 = 16 ⟹ d = ± 4
Step 4: Write down the resulting terms:
If d = + 4 d = +4 d = + 4 : Terms are 11 − 4 , 11 , 11 + 4 ⟹ 7 , 11 , 15 11 - 4, \; 11, \; 11 + 4 \implies 7, \; 11, \; 15 11 − 4 , 11 , 11 + 4 ⟹ 7 , 11 , 15 .
If d = − 4 d = -4 d = − 4 : Terms are 11 − ( − 4 ) , 11 , 11 + ( − 4 ) ⟹ 15 , 11 , 7 11 - (-4), \; 11, \; 11 + (-4) \implies 15, \; 11, \; 7 11 − ( − 4 ) , 11 , 11 + ( − 4 ) ⟹ 15 , 11 , 7 .
Conclusion: In either progression, the three terms are 7, 11, and 15 .
Worked Example 3: Railway Concrete Sleeper Deployment Modeling
Problem: A railway track maintenance gang is laying pre-stressed concrete sleepers along a new yard siding. The layout is divided into consecutive sections. The first section receives 24 sleepers, and each subsequent section receives 4 more sleepers than the previous one. If a total of 780 sleepers are laid across the entire siding, determine: (a) The total number of sections laid, and (b) The number of sleepers laid in the final section.
Step 1: Identify progression parameters: First term a = 24 a = 24 a = 24 , common difference d = 4 d = 4 d = 4 , aggregate sum S n = 780 S_n = 780 S n = 780 .
Step 2: Formulate the sum equation: S n = n 2 [ 2 a + ( n − 1 ) d ] = 780 S_n = \frac{n}{2} [2a + (n - 1)d] = 780 S n = 2 n [ 2 a + ( n − 1 ) d ] = 780 n 2 [ 2 ( 24 ) + ( n − 1 ) ( 4 ) ] = 780 \frac{n}{2} [2(24) + (n - 1)(4)] = 780 2 n [ 2 ( 24 ) + ( n − 1 ) ( 4 )] = 780 n 2 [ 48 + 4 n − 4 ] = n 2 [ 4 n + 44 ] = n ( 2 n + 22 ) = 2 n 2 + 22 n = 780 \frac{n}{2} [48 + 4n - 4] = \frac{n}{2} [4n + 44] = n(2n + 22) = 2n^2 + 22n = 780 2 n [ 48 + 4 n − 4 ] = 2 n [ 4 n + 44 ] = n ( 2 n + 22 ) = 2 n 2 + 22 n = 780
Step 3: Solve the quadratic equation: Divide by 2: n 2 + 11 n − 390 = 0 n^2 + 11n - 390 = 0 n 2 + 11 n − 390 = 0
Factor 390 390 390 : We seek two numbers with product − 390 -390 − 390 and difference 11 11 11 . Factors are 26 26 26 and 15 15 15 ( 26 × 15 = 390 26 \times 15 = 390 26 × 15 = 390 , 26 − 15 = 11 26 - 15 = 11 26 − 15 = 11 ): ( n + 26 ) ( n − 15 ) = 0 (n + 26)(n - 15) = 0 ( n + 26 ) ( n − 15 ) = 0
Since the number of sections n n n must be a positive integer, n = 15 n = 15 n = 15 .
Step 4: Compute sleepers in the final (15th) section: T 15 = a + ( 15 − 1 ) d = 24 + 14 ( 4 ) = 24 + 56 = 80 sleepers T_{15} = a + (15 - 1)d = 24 + 14(4) = 24 + 56 = 80 \text{ sleepers} T 15 = a + ( 15 − 1 ) d = 24 + 14 ( 4 ) = 24 + 56 = 80 sleepers
Conclusion: There are 15 sections , and the final section contains 80 sleepers .
The term-count formula dividing by d d d assumes d ≠ 0 d\ne0 d = 0 . For d = 0 d=0 d = 0 , every term equals a a a and the endpoints alone do not determine the number of terms.