Study guide

18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence

FTCE Mathematics 6-12 026

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Exam Overview & Rational Number Systems

1.1 FTCE Mathematics 6-12 Overview, Interface & Test-Taking Strategies 1.2 Rational Numbers, Representations & Multi-Step Operations

2 Chapter 2: Real Number Approximations & Proportional Reasoning

2.1 Irrational Numbers, Radical Estimation & Scientific Notation 2.2 Ratios, Rates, Proportions & Dimensional Analysis 2.3 Percent Applications, Financial Models & Depreciation

3 Chapter 3: Algebraic Expressions & Polynomial Operations

3.1 Polynomial Arithmetic, Factoring Strategies & Special Products 3.2 Radical Operations, Rational Expressions & Equations 3.3 Field Properties, Exponent Laws & Literal Equations

4 Chapter 4: Linear Relationships, Systems & Inequalities

4.1 Linear Equations, Slope Concepts & Line Forms 4.2 Systems of Linear Equations & Real-World Applications 4.3 Single & Systems of Linear Inequalities on the Coordinate Plane 4.4 Absolute Value Equations & Inequalities in One and Two Variables

5 Chapter 5: Quadratic Equations, Functions & Complex Numbers

5.1 Quadratic Equations, Discriminant & Complex Number Arithmetic 5.2 Quadratic Functions: Vertex, Axis, Intercepts & Concavity 5.3 Quadratic Inequalities in One/Two Variables & Optimization

6 Chapter 6: Function Foundations, Transformations & Inverses

6.1 Function Definitions, Relations, Domain, Range & Notation 6.2 Function Families, Key Graphical Behaviors & Even/Odd Symmetry 6.3 Shifting, Scaling & Reflecting Functions Across Representations 6.4 Function Composition, Invertibility & Inverse Functions

7 Chapter 7: Geometric Foundations, Angles & Deductive Proofs

7.1 Angle Relationships, Parallel Lines & Transversals 7.2 Triangle Sum, Exterior Angles & Polygon Angle Formulas 7.3 Formal Proof Methods, CPCTC & Quadrilateral Properties

8 Chapter 8: Congruence, Similarity & Geometric Transformations

8.1 Triangle Congruence (SSS, SAS, ASA, AAS, HL) & Similarity (AA, SAS, SSS) 8.2 Rigid Motions: Translations, Reflections, Rotations & Symmetry 8.3 Dilations, Scale Factors & Proportional Reasoning in Geometry

9 Chapter 9: Coordinate Geometry & 3D Spatial Measurement

9.1 Distance, Midpoint, Slope Criteria & Coordinate Proofs 9.2 Perimeter, Area, Surface Area & Volume of 2D and 3D Figures 9.3 Cross Sections of 3D Figures & Solids of Revolution

10 Chapter 10: Circle Theorems & Geometric Constructions

10.1 Central, Inscribed, Tangent & Chord Angles and Arcs 10.2 Intersecting Chords, Secant/Tangent Lengths, Arc Length & Sector Area 10.3 Euclidean Constructions with Compass and Straightedge

11 Chapter 11: Conic Sections & Coordinate Modeling

11.1 Circles and Parabolas: Geometric Definitions, Equations & Modeling 11.2 Ellipses and Hyperbolas: Foci, Axes, Asymptotes & Real-World Applications

12 Chapter 12: Trigonometric Foundations & Oblique Triangles

12.1 Right-Triangle Trigonometry, Pythagorean Theorem & Special Triangles 12.2 The Unit Circle, Radian Measure & Exact Trigonometric Values 12.3 Law of Sines (Ambiguous Case), Law of Cosines & Oblique Triangle Area

13 Chapter 13: Trigonometric Functions, Polar & Parametric Systems

13.1 Graphs of the Six Trigonometric Functions & Periodic Modeling 13.2 Polar Coordinates, Polar-Rectangular Conversion & Polar Graphs 13.3 Parametric Equations, Elimination of Parameters & Projectile Motion

14 Chapter 14: Descriptive Statistics & Data Distributions

14.1 Measures of Central Tendency, Dispersion & Resistant Statistics 14.2 Univariate Displays (Histograms, Boxplots, Stemplots) & Distribution Shapes 14.3 Normal Distribution Properties, Empirical Rule & Standard Normal Z-Scores

15 Chapter 15: Statistical Studies, Bivariate Data & Linear Regression

15.1 Statistical Study Design, Random Sampling Techniques & Sources of Bias 15.2 Survey Sampling, Margin of Error & Population Estimation 15.3 Scatterplots, Correlation Coefficient r, Linear Regression & Residuals

16 Chapter 16: Probability Theory, Two-Way Tables & Expected Value

16.1 Fundamental Counting Principle, Permutations & Combinations 16.2 Addition Rule, Multiplication Rule, Independent Events & Conditional Probability 16.3 Two-Way Frequency Tables, Law of Large Numbers & Expected Value of Random Variables

17 Chapter 17: Precalculus: Polynomial, Rational & Transcendental Functions

17.1 Fundamental Theorem of Algebra, Remainder/Factor Theorems & Polynomial Roots 17.2 Rational Functions, Domain Restrictions, Holes & Asymptotes 17.3 Exponential & Logarithmic Functions, Base e & Logarithmic Properties

18 Chapter 18: Sequences, Series, Binomial Theorem & Vectors

18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence 18.2 Binomial Theorem, Pascal's Triangle & General Term Determination 18.3 Vector Representations, Operations, Magnitude, Direction & Dot Product

19 Chapter 19: Differential Calculus Foundations

19.1 Limits, One-Sided Limits, Indeterminate Forms & Continuity 19.2 Derivative Definition, Power, Product, Quotient & Transcendental Rules 19.3 Chain Rule, Tangent Line Equations & Rates of Change

20 Chapter 20: Applications of Derivatives & Integral Calculus

20.1 First & Second Derivative Tests, Extrema, Concavity & Optimization 20.2 Antiderivatives, Indefinite Integrals & Integration by U-Substitution 20.3 Fundamental Theorem of Calculus, Net Signed Area & Geometric Applications

21 Chapter 21: Mathematical Representations, Progressions & Tools

21.1 Concrete-Representational-Abstract (CPA) Progressions & Concept Continuity 21.2 The Rule of Four: Translating Among Representations to Support Fluency 21.3 Manipulatives, Dynamic Software & Technology in Secondary Mathematics

22 Chapter 22: Assessment, Error Analysis & Misconception Remediation

22.1 Student Misconceptions & Error Analysis Across Core Secondary Domains 22.2 Evaluating Validity of Student Mathematical Arguments & Reasonableness Checks 22.3 Formative Assessment Formats, Data-Driven Differentiation & Tiered Tasks

18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence

Key Takeaways Explain This Topic AI

Arithmetic sequences exhibit a constant common difference d = a n − a n − 1 d = a_n - a_{n-1} d = a n ​ − a n − 1 ​ with explicit formula a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n ​ = a 1 ​ + ( n − 1 ) d , while finite arithmetic series sums evaluate to S n = n 2 ( a 1 + a n ) = n 2 [ 2 a 1 + ( n − 1 ) d ] S_n = \frac{n}{2}(a_1 + a_n) = \frac{n}{2}[2a_1 + (n - 1)d] S n ​ = 2 n ​ ( a 1 ​ + a n ​ ) = 2 n ​ [ 2 a 1 ​ + ( n − 1 ) d ] .

Geometric sequences exhibit a constant common ratio r = a n a n − 1 r = \frac{a_n}{a_{n-1}} r = a n − 1 ​ a n ​ ​ with explicit formula a n = a 1 r n − 1 a_n = a_1 r^{n-1} a n ​ = a 1 ​ r n − 1 , and finite geometric series evaluate to S n = a 1 ( 1 − r n ) 1 − r S_n = \frac{a_1(1 - r^n)}{1 - r} S n ​ = 1 − r a 1 ​ ( 1 − r n ) ​ for r ≠ 1 r \neq 1 r  = 1 .

An infinite geometric series converges to S = a 1 1 − r S = \frac{a_1}{1 - r} S = 1 − r a 1 ​ ​ if and only if ∣ r ∣ < 1 |r| < 1 ∣ r ∣ < 1 ; if ∣ r ∣ ≥ 1 |r| \ge 1 ∣ r ∣ ≥ 1 , the series strictly diverges by the Divergence Test.

Repeating decimals convert into exact rational fractions p q \frac{p}{q} q p ​ by decomposing the repeating period into an infinite geometric series with common ratio r = 10 − m r = 10^{-m} r = 1 0 − m , where m m m is the period length.

Sigma notation obeys linearity properties ∑ ( c a k + b k ) = c ∑ a k + ∑ b k \sum (c a_k + b_k) = c \sum a_k + \sum b_k ∑ ( c a k ​ + b k ​ ) = c ∑ a k ​ + ∑ b k ​ and permits systematic index shifting ∑ k = 1 n a k = ∑ j = 0 n − 1 a j + 1 \sum_{k=1}^n a_k = \sum_{j=0}^{n-1} a_{j+1} ∑ k = 1 n ​ a k ​ = ∑ j = 0 n − 1 ​ a j + 1 ​ without changing the numerical sum.

Last updated: September 2026

  • 18.1 Arithmetic & Geometric Sequences, Finite Sums & Infinite Series Convergence
  • Sequence Foundations: Explicit vs. Recursive Formulations

A sequence is formally defined as a function whose domain is the set of positive integers Z + = { 1 , 2 , 3 , … } \mathbb{Z}^+ = \{1, 2, 3, \dots\} Z + = { 1 , 2 , 3 , … } (or non-negative integers N 0 = { 0 , 1 , 2 , … } \mathbb{N}_0 = \{0, 1, 2, \dots\} N 0 ​ = { 0 , 1 , 2 , … } ), with range values corresponding to the terms of the sequence 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 ​ . Sequences are characterized algebraically through two primary modalities:

Explicit Formulas: An explicit formula expresses the n n n -th term directly as a function of its index: a n = f ( n ) a_n = f(n) a n ​ = f ( n ) . This representation allows instantaneous determination of any arbitrary term without prior calculation of preceding terms. For example, if a n = 3 n 2 − 5 a_n = 3n^2 - 5 a n ​ = 3 n 2 − 5 , the 15th term is directly a 15 = 3 ( 15 ) 2 − 5 = 670 a_{15} = 3(15)^2 - 5 = 670 a 15 ​ = 3 ( 15 ) 2 − 5 = 670 .

Recursive Formulas: A recursive specification defines the n n n -th term in relation to one or more preceding terms: a n = g ( a n − 1 ) a_n = g(a_{n-1}) a n ​ = g ( a n − 1 ​ ) , requiring one or more initial boundary conditions (such as a 1 a_1 a 1 ​ ). For instance, the system a 1 = 4 , a n = 3 a n − 1 − 2 a_1 = 4, a_n = 3a_{n-1} - 2 a 1 ​ = 4 , a n ​ = 3 a n − 1 ​ − 2 generates successive terms iteratively: a 2 = 3 ( 4 ) − 2 = 10 a_2 = 3(4) - 2 = 10 a 2 ​ = 3 ( 4 ) − 2 = 10 , a 3 = 3 ( 10 ) − 2 = 28 a_3 = 3(10) - 2 = 28 a 3 ​ = 3 ( 10 ) − 2 = 28 .

On the FTCE Mathematics 6-12 examination, translating between recursive relations and closed-form explicit expressions is a core analytical competency.

Arithmetic Sequences & Finite Arithmetic Series

An arithmetic sequence is defined by a constant difference d d d between any term and its predecessor, known as the common difference : d = a n − a n − 1 for all n ≥ 2 d = a_n - a_{n-1} \quad \text{for all } n \ge 2 d = a n ​ − a n − 1 ​ for all n ≥ 2

The recursive definition is a n = a n − 1 + d a_n = a_{n-1} + d a n ​ = a n − 1 ​ + d with given a 1 a_1 a 1 ​ . Unfolding this relation across successive indices yields the general explicit formula: a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n ​ = a 1 ​ + ( n − 1 ) d

Given two arbitrary terms a j a_j a j ​ and a k a_k a k ​ (with k > j k > j k > j ), the common difference is uniquely calculated by d = a k − a j k − j d = \frac{a_k - a_j}{k - j} d = k − j a k ​ − a j ​ ​ .

The sum of the first n n n terms of an arithmetic sequence constitutes a finite arithmetic series , denoted S n = ∑ k = 1 n a k S_n = \sum_{k=1}^n a_k S n ​ = ∑ k = 1 n ​ a k ​ . Deriving this sum by writing the terms forward and backward and adding the paired equations produces 2 S n = n ( a 1 + a n ) 2S_n = n(a_1 + a_n) 2 S n ​ = n ( a 1 ​ + a n ​ ) , leading directly to the classic summation formulas: S n = n 2 ( a 1 + a n ) = n 2 [ 2 a 1 + ( n − 1 ) d ] S_n = \frac{n}{2}(a_1 + a_n) = \frac{n}{2}[2a_1 + (n - 1)d] S n ​ = 2 n ​ ( a 1 ​ + a n ​ ) = 2 n ​ [ 2 a 1 ​ + ( n − 1 ) d ]

The quantity a 1 + a n 2 \frac{a_1 + a_n}{2} 2 a 1 ​ + a n ​ ​ represents the arithmetic mean of the first and last terms; thus, the sum is simply the number of terms multiplied by the average term value.

Geometric Sequences & Finite Geometric Series

A geometric sequence is defined by a constant non-zero multiplier r r r between consecutive terms, designated the common ratio : r = a n a n − 1 for all n ≥ 2 ( a n − 1 ≠ 0 ) r = \frac{a_n}{a_{n-1}} \quad \text{for all } n \ge 2 \quad (a_{n-1} \neq 0) r = a n − 1 ​ a n ​ ​ for all n ≥ 2 ( a n − 1 ​  = 0 )

The recursive definition is a n = r ⋅ a n − 1 a_n = r \cdot a_{n-1} a n ​ = r ⋅ a n − 1 ​ with initial term a 1 ≠ 0 a_1 \neq 0 a 1 ​  = 0 . Repeated multiplication gives the explicit closed form: a n = a 1 r n − 1 a_n = a_1 r^{n-1} a n ​ = a 1 ​ r n − 1

For two terms a j a_j a j ​ and a k a_k a k ​ , the terms satisfy r k − j = a k a j r^{k-j} = \frac{a_k}{a_j} r k − j = a j ​ a k ​ ​ .

A finite geometric series is the sum of the first n n n terms: S n = ∑ k = 1 n a 1 r k − 1 = a 1 + a 1 r + a 1 r 2 + ⋯ + a 1 r n − 1 S_n = \sum_{k=1}^n a_1 r^{k-1} = a_1 + a_1 r + a_1 r^2 + \dots + a_1 r^{n-1} S n ​ = ∑ k = 1 n ​ a 1 ​ r k − 1 = a 1 ​ + a 1 ​ r + a 1 ​ r 2 + ⋯ + a 1 ​ r n − 1 . Multiplying S n S_n S n ​ by r r r and subtracting the product from S n S_n S n ​ results in intermediate algebraic cancellation: S n − r S n = a 1 − a 1 r n ⟹ S n ( 1 − r ) = a 1 ( 1 − r n ) S_n - r S_n = a_1 - a_1 r^n \implies S_n(1 - r) = a_1(1 - r^n) S n ​ − r S n ​ = a 1 ​ − a 1 ​ r n ⟹ S n ​ ( 1 − r ) = a 1 ​ ( 1 − r n )

Dividing by ( 1 − r ) (1 - r) ( 1 − r ) establishes the finite sum formula: S n = a 1 ( 1 − r n ) 1 − r = a 1 ( r n − 1 ) r − 1 ( r ≠ 1 ) S_n = \frac{a_1(1 - r^n)}{1 - r} = \frac{a_1(r^n - 1)}{r - 1} \quad (r \neq 1) S n ​ = 1 − r a 1 ​ ( 1 − r n ) ​ = r − 1 a 1 ​ ( r n − 1 ) ​ ( r  = 1 )

If r = 1 r = 1 r = 1 , each term equals a 1 a_1 a 1 ​ , and the sum collapses to S n = n a 1 S_n = n a_1 S n ​ = n a 1 ​ .

Infinite Geometric Series & Convergence Criteria

An infinite geometric series takes the form ∑ k = 1 ∞ a 1 r k − 1 = a 1 + a 1 r + a 1 r 2 + … \sum_{k=1}^\infty a_1 r^{k-1} = a_1 + a_1 r + a_1 r^2 + \dots ∑ k = 1 ∞ ​ a 1 ​ r k − 1 = a 1 ​ + a 1 ​ r + a 1 ​ r 2 + … . The convergence of this infinite series is governed by the limiting behavior of the sequence of partial sums { S n } \{S_n\} { S n ​ } as n → ∞ n \to \infty n → ∞ : S = lim ⁡ n → ∞ S n = lim ⁡ n → ∞ a 1 ( 1 − r n ) 1 − r S = \lim_{n \to \infty} S_n = \lim_{n \to \infty} \frac{a_1(1 - r^n)}{1 - r} S = n → ∞ lim ​ S n ​ = n → ∞ lim ​ 1 − r a 1 ​ ( 1 − r n ) ​

Because lim ⁡ n → ∞ r n = 0 \lim_{n \to \infty} r^n = 0 lim n → ∞ ​ r n = 0 if and only if ∣ r ∣ < 1 |r| < 1 ∣ r ∣ < 1 , the infinite series converges to a finite sum under the strict condition ∣ r ∣ < 1 |r| < 1 ∣ r ∣ < 1 : S = a 1 1 − r for ∣ r ∣ < 1 S = \frac{a_1}{1 - r} \quad \text{for } |r| < 1 S = 1 − r a 1 ​ ​ for ∣ r ∣ < 1

If ∣ r ∣ ≥ 1 |r| \ge 1 ∣ r ∣ ≥ 1 (with a 1 ≠ 0 a_1 \neq 0 a 1 ​  = 0 ), lim ⁡ n → ∞ a n ≠ 0 \lim_{n \to \infty} a_n \neq 0 lim n → ∞ ​ a n ​  = 0 , violating the Divergence Test ( n n n -th Term Test for Divergence). Consequently, the series diverges , meaning its sum does not exist as a finite real number.

Repeating Decimals as Infinite Geometric Series

A direct pedagogical application of infinite geometric series is converting repeating decimals into simplified rational fractions p q \frac{p}{q} q p ​ ( p , q ∈ Z , q ≠ 0 p, q \in \mathbb{Z}, q \neq 0 p , q ∈ Z , q  = 0 ). Every repeating decimal consists of an initial non-repeating part plus an infinite series whose common ratio is r = 10 − m r = 10^{-m} r = 1 0 − m , where m m m is the period length of the repeating block. For example, consider 0. 45 ‾ = 0.454545 … 0.\overline{45} = 0.454545\dots 0. 45 = 0.454545 … : 0. 45 ‾ = 45 100 + 45 10 , 000 + 45 1 , 000 , 000 + … 0.\overline{45} = \frac{45}{100} + \frac{45}{10,000} + \frac{45}{1,000,000} + \dots 0. 45 = 100 45 ​ + 10 , 000 45 ​ + 1 , 000 , 000 45 ​ + …

Here, the first term is a 1 = 45 100 a_1 = \frac{45}{100} a 1 ​ = 100 45 ​ and the common ratio is r = 1 100 = 0.01 r = \frac{1}{100} = 0.01 r = 100 1 ​ = 0.01 . Because ∣ r ∣ = 0.01 < 1 |r| = 0.01 < 1 ∣ r ∣ = 0.01 < 1 , the infinite sum evaluates to: S = 45 100 1 − 1 100 = 45 100 99 100 = 45 99 = 5 11 S = \frac{\frac{45}{100}}{1 - \frac{1}{100}} = \frac{\frac{45}{100}}{\frac{99}{100}} = \frac{45}{99} = \frac{5}{11} S = 1 − 100 1 ​ 100 45 ​ ​ = 100 99 ​ 100 45 ​ ​ = 99 45 ​ = 11 5 ​

Sigma Notation Manipulation & Linearity Properties

Sigma notation provides a concise algebraic framework for summations: ∑ k = m n a k = a m + a m + 1 + ⋯ + a n \sum_{k=m}^n a_k = a_m + a_{m+1} + \dots + a_n ∑ k = m n ​ a k ​ = a m ​ + a m + 1 ​ + ⋯ + a n ​ . The total number of terms evaluated is ( n − m + 1 ) (n - m + 1) ( n − m + 1 ) . Essential properties include:

Linearity of Summation: ∑ k = m n ( c a k + b k ) = c ∑ k = m n a k + ∑ k = m n b k \sum_{k=m}^n (c a_k + b_k) = c \sum_{k=m}^n a_k + \sum_{k=m}^n b_k ∑ k = m n ​ ( c a k ​ + b k ​ ) = c ∑ k = m n ​ a k ​ + ∑ k = m n ​ b k ​ , where c c c is any constant.

Sum of a Constant: ∑ k = 1 n c = c ⋅ n \sum_{k=1}^n c = c \cdot n ∑ k = 1 n ​ c = c ⋅ n .

Index Shifting: Shifting the summation counter by an integer p p p alters the limits while maintaining equivalent terms: ∑ k = m n a k = ∑ j = m + p n + p a j − p \sum_{k=m}^n a_k = \sum_{j=m+p}^{n+p} a_{j-p} ∑ k = m n ​ a k ​ = ∑ j = m + p n + p ​ a j − p ​ .

Range Splitting: ∑ k = 1 n a k = ∑ k = 1 m a k + ∑ k = m + 1 n a k \sum_{k=1}^n a_k = \sum_{k=1}^m a_k + \sum_{k=m+1}^n a_k ∑ k = 1 n ​ a k ​ = ∑ k = 1 m ​ a k ​ + ∑ k = m + 1 n ​ a k ​ for 1 ≤ m < n 1 \le m < n 1 ≤ m < n .

Sequence and Series Formulas Summary

Classification Explicit n n n -th Term ( a n a_n a n ​ ) Recursive Definition Finite Sum ( S n S_n S n ​ ) Infinite Sum ( S ∞ S_\infty S ∞ ​ )

Arithmetic a n = a 1 + ( n − 1 ) d a_n = a_1 + (n - 1)d a n ​ = a 1 ​ + ( n − 1 ) d a n = a n − 1 + d a_n = a_{n-1} + d a n ​ = a n − 1 ​ + d S n = n 2 ( a 1 + a n ) = n 2 [ 2 a 1 + ( n − 1 ) d ] S_n = \frac{n}{2}(a_1 + a_n) = \frac{n}{2}[2a_1 + (n - 1)d] S n ​ = 2 n ​ ( a 1 ​ + a n ​ ) = 2 n ​ [ 2 a 1 ​ + ( n − 1 ) d ] Diverges for all d ≠ 0 d \neq 0 d  = 0

Geometric ( r ≠ 1 r \neq 1 r  = 1 ) a n = a 1 r n − 1 a_n = a_1 r^{n-1} a n ​ = a 1 ​ r n − 1 a n = r ⋅ a n − 1 a_n = r \cdot a_{n-1} a n ​ = r ⋅ a n − 1 ​ S n = a 1 ( 1 − r n ) 1 − r S_n = \frac{a_1(1 - r^n)}{1 - r} S n ​ = 1 − r a 1 ​ ( 1 − r n ) ​ S = a 1 1 − r S = \frac{a_1}{1 - r} S = 1 − r a 1 ​ ​ for ∣ r ∣ < 1 \vert r\vert< 1 ∣ r ∣ < 1 ; Diverges for ∣ r ∣ ≥ 1 \vert r\vert\ge 1 ∣ r ∣ ≥ 1

Worked Exemplar: Parameterized Infinite Geometric Series

Problem: Determine all values of x x x for which the infinite geometric series ∑ k = 1 ∞ 6 ( 3 x − 4 5 ) k \sum_{k=1}^\infty 6 \left(\frac{3x - 4}{5}\right)^k ∑ k = 1 ∞ ​ 6 ( 5 3 x − 4 ​ ) k converges. Express its sum S ( x ) S(x) S ( x ) as a simplified rational function, and evaluate S ( 1 ) S(1) S ( 1 ) .

Step 1: Identify Initial Term and Common Ratio. Expand the first few terms of the series: ∑ k = 1 ∞ 6 ( 3 x − 4 5 ) k = 6 ( 3 x − 4 5 ) + 6 ( 3 x − 4 5 ) 2 + 6 ( 3 x − 4 5 ) 3 + … \sum_{k=1}^\infty 6 \left(\frac{3x - 4}{5}\right)^k = 6\left(\frac{3x - 4}{5}\right) + 6\left(\frac{3x - 4}{5}\right)^2 + 6\left(\frac{3x - 4}{5}\right)^3 + \dots k = 1 ∑ ∞ ​ 6 ( 5 3 x − 4 ​ ) k = 6 ( 5 3 x − 4 ​ ) + 6 ( 5 3 x − 4 ​ ) 2 + 6 ( 5 3 x − 4 ​ ) 3 + …

The first term is a 1 = 6 ( 3 x − 4 5 ) = 18 x − 24 5 a_1 = 6\left(\frac{3x - 4}{5}\right) = \frac{18x - 24}{5} a 1 ​ = 6 ( 5 3 x − 4 ​ ) = 5 18 x − 24 ​ . The common ratio between consecutive terms is r = 3 x − 4 5 r = \frac{3x - 4}{5} r = 5 3 x − 4 ​ .

Step 2: Determine Interval of Convergence. An infinite geometric series converges if and only if ∣ r ∣ < 1 |r| < 1 ∣ r ∣ < 1 : ∣ 3 x − 4 5 ∣ < 1 ⟺ − 1 < 3 x − 4 5 < 1 \left|\frac{3x - 4}{5}\right| < 1 \iff -1 < \frac{3x - 4}{5} < 1 ​ 5 3 x − 4 ​ ​ < 1 ⟺ − 1 < 5 3 x − 4 ​ < 1

  • Multiply through by 5: − 5 < 3 x − 4 < 5 -5 < 3x - 4 < 5 − 5 < 3 x − 4 < 5
  • Add 4 to all expressions: − 1 < 3 x < 9 -1 < 3x < 9 − 1 < 3 x < 9
  • Divide by 3: − 1 3 < x < 3 -\frac{1}{3} < x < 3 − 3 1 ​ < x < 3

Thus, the series converges strictly on the open interval x ∈ ( − 1 3 , 3 ) x \in \left(-\frac{1}{3}, 3\right) x ∈ ( − 3 1 ​ , 3 ) .

Step 3: Construct Rational Sum Function S ( x ) S(x) S ( x ) . Apply the infinite sum formula S = a 1 1 − r S = \frac{a_1}{1 - r} S = 1 − r a 1 ​ ​ : S ( x ) = 6 ( 3 x − 4 ) 5 1 − 3 x − 4 5 = 6 ( 3 x − 4 ) 5 5 − ( 3 x − 4 ) 5 = 6 ( 3 x − 4 ) 5 − 3 x + 4 = 18 x − 24 9 − 3 x = 6 ( 3 x − 4 ) 3 ( 3 − x ) = 2 ( 3 x − 4 ) 3 − x S(x) = \frac{\frac{6(3x - 4)}{5}}{1 - \frac{3x - 4}{5}} = \frac{\frac{6(3x - 4)}{5}}{\frac{5 - (3x - 4)}{5}} = \frac{6(3x - 4)}{5 - 3x + 4} = \frac{18x - 24}{9 - 3x} = \frac{6(3x - 4)}{3(3 - x)} = \frac{2(3x - 4)}{3 - x} S ( x ) = 1 − 5 3 x − 4 ​ 5 6 ( 3 x − 4 ) ​ ​ = 5 5 − ( 3 x − 4 ) ​ 5 6 ( 3 x − 4 ) ​ ​ = 5 − 3 x + 4 6 ( 3 x − 4 ) ​ = 9 − 3 x 18 x − 24 ​ = 3 ( 3 − x ) 6 ( 3 x − 4 ) ​ = 3 − x 2 ( 3 x − 4 ) ​

Step 4: Evaluate the Sum at x = 1 x = 1 x = 1 . Because x = 1 ∈ ( − 1 3 , 3 ) x = 1 \in \left(-\frac{1}{3}, 3\right) x = 1 ∈ ( − 3 1 ​ , 3 ) , substitute directly into S ( x ) S(x) S ( x ) : S ( 1 ) = 2 ( 3 ( 1 ) − 4 ) 3 − 1 = 2 ( − 1 ) 2 = − 1 S(1) = \frac{2(3(1) - 4)}{3 - 1} = \frac{2(-1)}{2} = -1 S ( 1 ) = 3 − 1 2 ( 3 ( 1 ) − 4 ) ​ = 2 2 ( − 1 ) ​ = − 1

Verifying with original series parameters at x = 1 x = 1 x = 1 : r = 3 ( 1 ) − 4 5 = − 1 5 , a 1 = 6 ( − 1 5 ) = − 6 5 r = \frac{3(1) - 4}{5} = -\frac{1}{5}, \quad a_1 = 6\left(-\frac{1}{5}\right) = -\frac{6}{5} r = 5 3 ( 1 ) − 4 ​ = − 5 1 ​ , a 1 ​ = 6 ( − 5 1 ​ ) = − 5 6 ​ S = − 6 5 1 − ( − 1 5 ) = − 6 5 6 5 = − 1 S = \frac{-\frac{6}{5}}{1 - \left(-\frac{1}{5}\right)} = \frac{-\frac{6}{5}}{\frac{6}{5}} = -1 S = 1 − ( − 5 1 ​ ) − 5 6 ​ ​ = 5 6 ​ − 5 6 ​ ​ = − 1

The derived closed-form function confirms the numerical sum.