An infinite series is a sum with infinitely many terms.
If a sequence has terms \(u_1, u_2, u_3, \dots\), then the \(n^{\text{th}}\) partial sum is
\[ S_n = u_1 + u_2 + \dots + u_n. \]If \(S_n\) tends to a limit \(S\) as \(n \to \infty\), then \(S\) is called the sum to infinity of the series:
\[ \sum_{n=1}^{\infty} u_n = S \quad\text{if}\quad \lim_{n\to\infty} S_n = S. \]For an arithmetic sequence with first term \(a\) and common difference \(d\):
As \(n \to \infty\), unless \(d = 0\), the partial sums grow without bound.
Conclusion: the sum to infinity of a non‑constant arithmetic series is undefined.
For a geometric sequence with first term \(a\) and common ratio \(r\):
The sum of the first \(n\) terms is:
Behaviour of \(r^n\) as \(n \to \infty\):
The sum to infinity is:
Undefined when \(|r| \ge 1\).
Defined when \(|r| < 1\), and then
\[ \sum_{n=1}^{\infty} ar^{n-1} = \frac{a}{1-r}, \quad |r| < 1. \]Find the sum to infinity of the series
\(96 + 48 + 24 + \dots\), if it exists.
Here \(a = 96\), \(r = \dfrac{48}{96} = \dfrac{1}{2}\), and \(|r| < 1\).
\[ S_{\infty} = \frac{96}{1 - \frac{1}{2}} = \frac{96}{\frac{1}{2}} = 192. \]Express the recurring decimal \(0.242424\ldots\) as a fraction.
Write \[ 0.242424\ldots = 0.24 + 0.0024 + 0.000024 + \dots \] This is geometric with \[ a = 0.24,\quad r = 0.01. \]
\[ S_{\infty} = \frac{0.24}{1 - 0.01} = \frac{0.24}{0.99} = \frac{24}{99} = \frac{8}{33}. \]Given that 12 and 6 are two adjacent terms of an infinite geometric series with sum to infinity \(192\):
(a) Find the first term. (b) Find the partial sum \(S_6\).
Adjacent terms 12 and 6 give \[ r = \frac{6}{12} = \frac{1}{2}. \]
Let the first term be \(a\). Then
\[ S_{\infty} = \frac{a}{1-r} = 192 \quad\Rightarrow\quad \frac{a}{1 - \frac{1}{2}} = 192 \quad\Rightarrow\quad a = 96. \]The terms are \(96, 48, 24, 12, 6, 3, \dots\)
\[ S_6 = 96\,\frac{1 - \left(\frac{1}{2}\right)^6}{1 - \frac{1}{2}} = 96 \cdot 2 \left(1 - \frac{1}{64}\right) = 192 \cdot \frac{63}{64} = \frac{12096}{64} = 189. \]We use sigma notation to write sums compactly:
\[ \sum_{k=1}^{n} u_k = u_1 + u_2 + \dots + u_n. \]Constant multiplier:
\[ \sum_{k=1}^{n} c\,u_k = c \sum_{k=1}^{n} u_k. \]Adding series:
\[ \sum_{k=1}^{n} (u_k + v_k) = \sum_{k=1}^{n} u_k + \sum_{k=1}^{n} v_k. \]The first \(n\) natural numbers are:
\[ 1 + 2 + 3 + \dots + n. \]Find the value of
Useful results:
Find the value of
\[ \sum_{k=1}^{10} (3k^2 + 2k). \]Using the rules:
\[ \sum_{k=1}^{10} (3k^2 + 2k) = 3\sum_{k=1}^{10} k^2 + 2\sum_{k=1}^{10} k. \] \[ 3\cdot \frac{10\cdot 11\cdot 21}{6} + 2\cdot \frac{10\cdot 11}{2} = 3\cdot 385 + 2\cdot 55 = 1155 + 110 = 1265. \]Some common finite sums:
A power series in \(x\) has the form:
\[ \sum_{n=0}^{\infty} a_n x^n = a_0 + a_1 x + a_2 x^2 + \dots \]where \(a_0, a_1, a_2, \dots\) are constants.
The series always converges at \(x = 0\). It may converge for other values of \(x\).
A necessary condition for convergence is that the terms tend to zero: \[ \lim_{n\to\infty} a_n x^n = 0. \]
For a series of positive terms \(\sum u_n\), consider
\[ L = \lim_{n\to\infty} \frac{u_{n+1}}{u_n}. \]Use d’Alembert’s ratio test to test convergence of
\[ \sum_{n=1}^{\infty} \frac{n!}{2^n}. \]Here \(u_n = \dfrac{n!}{2^n}\). Then
\[ \frac{u_{n+1}}{u_n} = \frac{(n+1)!/2^{n+1}}{n!/2^n} = \frac{n+1}{2}. \]As \(n \to \infty\), \(\dfrac{n+1}{2} \to \infty > 1\), so the series diverges.
A series \(\sum u_n\) is said to be absolutely convergent if
\[ \sum |u_n| \]converges.
If a series is absolutely convergent, then it is convergent.
Example. Find the sum to infinity of the series
\[ 4 + 7x + 10x^{2} + 13x^{3} + \ldots \]and the region of valid values of \(x\).
Multiply by \(x\):
\[ xS_n = 4x + 7x^{2} + 10x^{3} + 13x^{4} + \ldots + (3n+1)x^{\,n} \]Subtract:
\[ S_n(1 - x) = 4 + 3x + 3x^{2} + 3x^{3} + \ldots + 3x^{\,n-1} - (3n+1)x^{\,n} \] \[ = 4 + 3\left(x + x^{2} + x^{3} + \ldots + x^{\,n-1}\right) - (3n+1)x^{\,n} \] \[ = 4 + 3\left(\frac{x(1 - x^{\,n-1})}{1 - x}\right) - (3n+1)x^{\,n} \]The Fibonacci sequence is defined by:
\[ u_1 = 1,\quad u_2 = 1,\quad u_{n+2} = u_{n+1} + u_n. \]So the sequence begins:
\[ 1,\; 1,\; 2,\; 3,\; 5,\; 8,\; 13,\; \dots \]Why does the ratio of successive Fibonacci numbers approach the golden ratio?
The Fibonacci sequence satisfies the recurrence
\[ F_{n+1} = F_n + F_{n-1}. \]Divide both sides by \(F_n\):
\[ \frac{F_{n+1}}{F_n} = 1 + \frac{F_{n-1}}{F_n} = 1 + \frac{1}{F_n/F_{n-1}}. \]Let
\[ L = \lim_{n\to\infty} \frac{F_{n+1}}{F_n}. \]Then also
\[ \lim_{n\to\infty} \frac{F_n}{F_{n-1}} = L. \]So in the limit the recurrence becomes
\[ L = 1 + \frac{1}{L}. \]Multiply through:
\[ L^2 = L + 1. \]Solve the quadratic:
\[ L = \frac{1 \pm \sqrt{5}}{2}. \]Since Fibonacci ratios are positive, we take the positive root:
\[ \boxed{ \displaystyle \lim_{n\to\infty} \frac{F_{n+1}}{F_n} = \frac{1 + \sqrt{5}}{2} } \]This number is the golden ratio.
A power series can be written in the form:
where \(c\) is the centre of convergence.
This is the middle of the interval of convergence,
the interval for which the limit exists.
The series converges for \(x\) in an interval centred at \(c\), of radius \(R\),
called the radius of convergence.
If \(R = \infty\), the series converges for all real \(x\).
Otherwise, the series converges for \( |x - c| < R \)
and diverges for \( |x - c| > R. \)
To find a0, set x = c , since the remaining terms will become zero.
differentiate
To find a1, evaluate f’(c)
go again
Continuing gives the following
and
so that
Substituting back into the original series
In the interval \((\, -R + c,\; R + c \,)\)
\[ f'(x) = \sum_{n=1}^{\infty} n a_n (x - c)^{n-1} \quad\Rightarrow\quad f'(c) = a_1, \] \[ f''(x) = \sum_{n=2}^{\infty} n(n-1)a_n (x - c)^{n-2} \quad\Rightarrow\quad f''(c) = 2! a_2, \]and in general
The Taylor series of a function \(f(x)\) about \(x = c\) is
\[ f(x) = \sum_{n=0}^{\infty} \frac{f^{(n)}(c)}{n!}(x - c)^n. \]In particular, about \(x = 0\) (Maclaurin series):
\[ f(x) = f(0) + f'(0)x + \frac{f''(0)}{2!}x^2 + \dots \]For worked examples, see the Taylor / Maclaurin examples .