A[Diag Sequences And Series] --> B[Key Concepts]
A --> D[Practical Applications]
B --> E[Fundamental definitions]
D --> G[Real-world usage]
Mathematics is the language of patterns and logic, a tool for describing relationships and solving problems.
Tests edge cases, boundary conditions, and common misconceptions for sequences and series.
Question:
Evaluate the sum:
S n = ∑ r = 1 n 1 r ( r + 1 ) ( r + 2 ) S_n = \sum_{r=1}^{n} \frac{1}{r(r+1)(r+2)} S n = r = 1 ∑ n r ( r + 1 ) ( r + 2 ) 1 Express your answer in terms of n n n And hence find lim n → ∞ S n \lim_{n \to \infty} S_n lim n → ∞ S n .
[Difficulty: hard. Tests partial fraction decomposition for a telescoping series with three factors in the denominator, where the cancellation pattern is commonly misidentified.]
Solution:
Step 1: Partial fraction decomposition.
We seek constants A A A , B B B , C C C such that:
1 r ( r + 1 ) ( r + 2 ) = A r + B r + 1 + C r + 2 \frac{1}{r(r+1)(r+2)} = \frac{A}{r} + \frac{B}{r+1} + \frac{C}{r+2} r ( r + 1 ) ( r + 2 ) 1 = r A + r + 1 B + r + 2 C Multiplying through by r ( r + 1 ) ( r + 2 ) r(r+1)(r+2) r ( r + 1 ) ( r + 2 ) :
1 = A ( r + 1 ) ( r + 2 ) + B r ( r + 2 ) + C r ( r + 1 ) 1 = A(r+1)(r+2) + Br(r+2) + Cr(r+1) 1 = A ( r + 1 ) ( r + 2 ) + B r ( r + 2 ) + C r ( r + 1 ) Substituting r = 0 r = 0 r = 0 : 1 = A ( 1 ) ( 2 ) ⟹ A = 1 2 1 = A(1)(2) \implies A = \frac{1}{2} 1 = A ( 1 ) ( 2 ) ⟹ A = 2 1 .
Substituting r = − 1 r = -1 r = − 1 : 1 = B ( − 1 ) ( 1 ) ⟹ B = − 1 1 = B(-1)(1) \implies B = -1 1 = B ( − 1 ) ( 1 ) ⟹ B = − 1 .
Substituting r = − 2 r = -2 r = − 2 : 1 = C ( − 2 ) ( − 1 ) ⟹ C = 1 2 1 = C(-2)(-1) \implies C = \frac{1}{2} 1 = C ( − 2 ) ( − 1 ) ⟹ C = 2 1 .
Step 2: Verify.
1 / 2 r − 1 r + 1 + 1 / 2 r + 2 = ( r + 1 ) ( r + 2 ) − 2 r ( r + 2 ) + r ( r + 1 ) 2 r ( r + 1 ) ( r + 2 ) \frac{1/2}{r} - \frac{1}{r+1} + \frac{1/2}{r+2} = \frac{(r+1)(r+2) - 2r(r+2) + r(r+1)}{2r(r+1)(r+2)} r 1/2 − r + 1 1 + r + 2 1/2 = 2 r ( r + 1 ) ( r + 2 ) ( r + 1 ) ( r + 2 ) − 2 r ( r + 2 ) + r ( r + 1 ) Numerator: ( r 2 + 3 r + 2 ) + ( − 2 r 2 − 4 r ) + ( r 2 + r ) = ( r 2 − 2 r 2 + r 2 ) + ( 3 r − 4 r + r ) + 2 = 0 + 0 + 2 = 2 (r^2 + 3r + 2) + (-2r^2 - 4r) + (r^2 + r) = (r^2 - 2r^2 + r^2) + (3r - 4r + r) + 2 = 0 + 0 + 2 = 2 ( r 2 + 3 r + 2 ) + ( − 2 r 2 − 4 r ) + ( r 2 + r ) = ( r 2 − 2 r 2 + r 2 ) + ( 3 r − 4 r + r ) + 2 = 0 + 0 + 2 = 2 .
So the fraction is 2 2 r ( r + 1 ) ( r + 2 ) = 1 r ( r + 1 ) ( r + 2 ) \frac{2}{2r(r+1)(r+2)} = \frac{1}{r(r+1)(r+2)} 2 r ( r + 1 ) ( r + 2 ) 2 = r ( r + 1 ) ( r + 2 ) 1 . Confirmed.
Step 3: Write out the telescoping sum.
S n = ∑ r = 1 n ( 1 / 2 r − 1 r + 1 + 1 / 2 r + 2 ) S_n = \sum_{r=1}^{n}\left(\frac{1/2}{r} - \frac{1}{r+1} + \frac{1/2}{r+2}\right) S n = r = 1 ∑ n ( r 1/2 − r + 1 1 + r + 2 1/2 ) = 1 2 ∑ r = 1 n 1 r − ∑ r = 1 n 1 r + 1 + 1 2 ∑ r = 1 n 1 r + 2 = \frac{1}{2}\sum_{r=1}^{n}\frac{1}{r} - \sum_{r=1}^{n}\frac{1}{r+1} + \frac{1}{2}\sum_{r=1}^{n}\frac{1}{r+2} = 2 1 r = 1 ∑ n r 1 − r = 1 ∑ n r + 1 1 + 2 1 r = 1 ∑ n r + 2 1 Re-index the sums:
= 1 2 ∑ r = 1 n 1 r − ∑ r = 2 n + 1 1 r + 1 2 ∑ r = 3 n + 2 1 r = \frac{1}{2}\sum_{r=1}^{n}\frac{1}{r} - \sum_{r=2}^{n+1}\frac{1}{r} + \frac{1}{2}\sum_{r=3}^{n+2}\frac{1}{r} = 2 1 r = 1 ∑ n r 1 − r = 2 ∑ n + 1 r 1 + 2 1 r = 3 ∑ n + 2 r 1 = ( 1 2 ⋅ 1 + 1 2 ⋅ 1 2 + 1 2 ∑ r = 3 n 1 r ) − ( 1 2 + ∑ r = 3 n 1 r + 1 n + 1 ) + ( 1 2 ∑ r = 3 n 1 r + 1 2 ⋅ 1 n + 1 + 1 2 ⋅ 1 n + 2 ) = \left(\frac{1}{2} \cdot 1 + \frac{1}{2} \cdot \frac{1}{2} + \frac{1}{2}\sum_{r=3}^{n}\frac{1}{r}\right) - \left(\frac{1}{2} + \sum_{r=3}^{n}\frac{1}{r} + \frac{1}{n+1}\right) + \left(\frac{1}{2}\sum_{r=3}^{n}\frac{1}{r} + \frac{1}{2}\cdot\frac{1}{n+1} + \frac{1}{2}\cdot\frac{1}{n+2}\right) = ( 2 1 ⋅ 1 + 2 1 ⋅ 2 1 + 2 1 r = 3 ∑ n r 1 ) − ( 2 1 + r = 3 ∑ n r 1 + n + 1 1 ) + ( 2 1 r = 3 ∑ n r 1 + 2 1 ⋅ n + 1 1 + 2 1 ⋅ n + 2 1 ) Collecting terms involving ∑ r = 3 n 1 r \sum_{r=3}^{n}\frac{1}{r} ∑ r = 3 n r 1 : 1 2 − 1 + 1 2 = 0 \frac{1}{2} - 1 + \frac{1}{2} = 0 2 1 − 1 + 2 1 = 0 . The sums cancel (confirming the telescoping).
Remaining terms:
1 2 + 1 4 − 1 2 − 1 n + 1 + 1 2 ( n + 1 ) + 1 2 ( n + 2 ) \frac{1}{2} + \frac{1}{4} - \frac{1}{2} - \frac{1}{n+1} + \frac{1}{2(n+1)} + \frac{1}{2(n+2)} 2 1 + 4 1 − 2 1 − n + 1 1 + 2 ( n + 1 ) 1 + 2 ( n + 2 ) 1 = 1 4 − 1 2 ( n + 1 ) + 1 2 ( n + 1 ) + 1 2 ( n + 2 ) = \frac{1}{4} - \frac{1}{2(n+1)} + \frac{1}{2(n+1)} + \frac{1}{2(n+2)} = 4 1 − 2 ( n + 1 ) 1 + 2 ( n + 1 ) 1 + 2 ( n + 2 ) 1 = 1 4 + 1 2 ( n + 2 ) = \frac{1}{4} + \frac{1}{2(n+2)} = 4 1 + 2 ( n + 2 ) 1 Step 4: Find the limit.
lim n → ∞ S n = 1 4 + 0 = 1 4 \lim_{n \to \infty} S_n = \frac{1}{4} + 0 = \frac{1}{4} n → ∞ lim S n = 4 1 + 0 = 4 1 Question:
Given that ∑ r = 1 n r 2 = n ( n + 1 ) ( 2 n + 1 ) 6 \sum_{r=1}^{n} r^2 = \frac{n(n+1)(2n+1)}{6} ∑ r = 1 n r 2 = 6 n ( n + 1 ) ( 2 n + 1 ) Find the value of:
∑ r = 4 n + 3 ( r − 3 ) 2 \sum_{r=4}^{n+3} (r-3)^2 r = 4 ∑ n + 3 ( r − 3 ) 2 In terms of n n n .
A common student error is to substitute r − 3 r - 3 r − 3 into the formula and write ( n + 3 ) ( n + 4 ) ( 2 n + 7 ) 6 \frac{(n+3)(n+4)(2n+7)}{6} 6 ( n + 3 ) ( n + 4 ) ( 2 n + 7 ) . Identify the mistake in this approach and give the correct answer.
[Difficulty: hard. Tests the common error of not adjusting the summation limits when performing an index shift.]
Solution:
The student”s error: The student substitutes r − 3 r - 3 r − 3 for r r r in the formula but forgets that the upper limit also changes. The formula ∑ r = 1 m r 2 = m ( m + 1 ) ( 2 m + 1 ) 6 \sum_{r=1}^{m} r^2 = \frac{m(m+1)(2m+1)}{6} ∑ r = 1 m r 2 = 6 m ( m + 1 ) ( 2 m + 1 ) requires the sum to start at r = 1 r = 1 r = 1 and end at r = m r = m r = m .
Correct approach, Method 1: Index shift.
Let k = r − 3 k = r - 3 k = r − 3 . When r = 4$$k = 1 . When r = n + 3$$k = n .
∑ r = 4 n + 3 ( r − 3 ) 2 = ∑ k = 1 n k 2 = n ( n + 1 ) ( 2 n + 1 ) 6 \sum_{r=4}^{n+3} (r-3)^2 = \sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6} r = 4 ∑ n + 3 ( r − 3 ) 2 = k = 1 ∑ n k 2 = 6 n ( n + 1 ) ( 2 n + 1 ) Correct approach, Method 2: Subtract sums.
∑ r = 4 n + 3 ( r − 3 ) 2 = ∑ r = 1 n + 3 ( r − 3 ) 2 − ∑ r = 1 3 ( r − 3 ) 2 \sum_{r=4}^{n+3} (r-3)^2 = \sum_{r=1}^{n+3} (r-3)^2 - \sum_{r=1}^{3} (r-3)^2 r = 4 ∑ n + 3 ( r − 3 ) 2 = r = 1 ∑ n + 3 ( r − 3 ) 2 − r = 1 ∑ 3 ( r − 3 ) 2 Note that ∑ r = 1 n + 3 ( r − 3 ) 2 = ∑ k = − 2 n k 2 \sum_{r=1}^{n+3}(r-3)^2 = \sum_{k=-2}^{n} k^2 ∑ r = 1 n + 3 ( r − 3 ) 2 = ∑ k = − 2 n k 2 where k = r − 3 k = r - 3 k = r − 3 . This is not the standard form. We need to be more careful:
∑ r = 4 n + 3 ( r − 3 ) 2 = ∑ r = 1 n + 3 ( r − 3 ) 2 − ∑ r = 1 3 ( r − 3 ) 2 \sum_{r=4}^{n+3} (r-3)^2 = \sum_{r=1}^{n+3}(r-3)^2 - \sum_{r=1}^{3}(r-3)^2 r = 4 ∑ n + 3 ( r − 3 ) 2 = r = 1 ∑ n + 3 ( r − 3 ) 2 − r = 1 ∑ 3 ( r − 3 ) 2 = ∑ k = − 2 n k 2 − [ ( − 2 ) 2 + ( − 1 ) 2 + 0 2 ] = \sum_{k=-2}^{n} k^2 - [(-2)^2 + (-1)^2 + 0^2] = k = − 2 ∑ n k 2 − [( − 2 ) 2 + ( − 1 ) 2 + 0 2 ] = ∑ k = 1 n k 2 + ( − 2 ) 2 + ( − 1 ) 2 − [ 4 + 1 + 0 ] = \sum_{k=1}^{n} k^2 + (-2)^2 + (-1)^2 - [4 + 1 + 0] = k = 1 ∑ n k 2 + ( − 2 ) 2 + ( − 1 ) 2 − [ 4 + 1 + 0 ] = ∑ k = 1 n k 2 + 4 + 1 − 5 = ∑ k = 1 n k 2 = n ( n + 1 ) ( 2 n + 1 ) 6 = \sum_{k=1}^{n} k^2 + 4 + 1 - 5 = \sum_{k=1}^{n} k^2 = \frac{n(n+1)(2n+1)}{6} = k = 1 ∑ n k 2 + 4 + 1 − 5 = k = 1 ∑ n k 2 = 6 n ( n + 1 ) ( 2 n + 1 ) The student’s answer was ( n + 3 ) ( n + 4 ) ( 2 n + 7 ) 6 \frac{(n+3)(n+4)(2n+7)}{6} 6 ( n + 3 ) ( n + 4 ) ( 2 n + 7 ) Which equals ∑ r = 1 n + 3 r 2 \sum_{r=1}^{n+3} r^2 ∑ r = 1 n + 3 r 2 Not ∑ r = 4 n + 3 ( r − 3 ) 2 \sum_{r=4}^{n+3}(r-3)^2 ∑ r = 4 n + 3 ( r − 3 ) 2 . The student incorrectly treated the sum as starting from r = 1 r = 1 r = 1 with upper limit n + 3 n + 3 n + 3 .
Question:
A sequence is defined by the recurrence relation:
u n + 2 = 5 u n + 1 − 6 u n , n ≥ 1 u_{n+2} = 5u_{n+1} - 6u_n, \quad n \geq 1 u n + 2 = 5 u n + 1 − 6 u n , n ≥ 1 With u 1 = 1 u_1 = 1 u 1 = 1 and u 2 = 5 u_2 = 5 u 2 = 5 .
(a) Find u 3 u_3 u 3 , u 4 u_4 u 4 And u 5 u_5 u 5 .
(b) Find a closed-form expression for u n u_n u n in terms of n n n .
(c) Find the smallest value of n n n such that u n > 10000 u_n > 10000 u n > 10000 .
[Difficulty: hard. Tests solving second-order linear recurrence relations using the characteristic equation method.]
Solution:
(a)
u 3 = 5 ( 5 ) − 6 ( 1 ) = 25 − 6 = 19 u_3 = 5(5) - 6(1) = 25 - 6 = 19 u 3 = 5 ( 5 ) − 6 ( 1 ) = 25 − 6 = 19 u 4 = 5 ( 19 ) − 6 ( 5 ) = 95 − 30 = 65 u_4 = 5(19) - 6(5) = 95 - 30 = 65 u 4 = 5 ( 19 ) − 6 ( 5 ) = 95 − 30 = 65 u 5 = 5 ( 65 ) − 6 ( 19 ) = 325 − 114 = 211 u_5 = 5(65) - 6(19) = 325 - 114 = 211 u 5 = 5 ( 65 ) − 6 ( 19 ) = 325 − 114 = 211 (b) The characteristic equation is:
λ 2 − 5 λ + 6 = 0 \lambda^2 - 5\lambda + 6 = 0 λ 2 − 5 λ + 6 = 0 ( λ − 2 ) ( λ − 3 ) = 0 (\lambda - 2)(\lambda - 3) = 0 ( λ − 2 ) ( λ − 3 ) = 0
λ = 2 or λ = 3 \lambda = 2 \quad \text{or} \quad \lambda = 3 λ = 2 or λ = 3 The general solution is u n = A ⋅ 2 n + B ⋅ 3 n u_n = A \cdot 2^n + B \cdot 3^n u n = A ⋅ 2 n + B ⋅ 3 n .
Using the initial conditions:
n = 1 : A ⋅ 2 + B ⋅ 3 = 1 n = 1: A \cdot 2 + B \cdot 3 = 1 n = 1 : A ⋅ 2 + B ⋅ 3 = 1 n = 2 : A ⋅ 4 + B ⋅ 9 = 5 n = 2: A \cdot 4 + B \cdot 9 = 5 n = 2 : A ⋅ 4 + B ⋅ 9 = 5
From the first equation: A = 1 − 3 B 2 A = \frac{1 - 3B}{2} A = 2 1 − 3 B .
Substituting into the second:
4 ( 1 − 3 B 2 ) + 9 B = 5 4\left(\frac{1-3B}{2}\right) + 9B = 5 4 ( 2 1 − 3 B ) + 9 B = 5 2 − 6 B + 9 B = 5 2 - 6B + 9B = 5 2 − 6 B + 9 B = 5 3 B = 3 3B = 3 3 B = 3 B = 1 B = 1 B = 1
A = 1 − 3 2 = − 1 A = \frac{1 - 3}{2} = -1 A = 2 1 − 3 = − 1 u n = 3 n − 2 n u_n = 3^n - 2^n u n = 3 n − 2 n Verification: u 1 = 3 − 2 = 1 u_1 = 3 - 2 = 1 u 1 = 3 − 2 = 1 ✓. u 2 = 9 − 4 = 5 u_2 = 9 - 4 = 5 u 2 = 9 − 4 = 5 ✓. u 3 = 27 − 8 = 19 u_3 = 27 - 8 = 19 u 3 = 27 − 8 = 19 ✓.
(c) We need 3 n − 2 n > 10000 3^n - 2^n > 10000 3 n − 2 n > 10000 .
For large n n n , 3 n 3^n 3 n dominates 2 n 2^n 2 n . We need 3 n ⪆ 10000 3^n \gtrapprox 10000 3 n ⪆ 10000 .
n = 8 n = 8 n = 8 : 3 8 − 2 8 = 6561 − 256 = 6305 < 10000 3^8 - 2^8 = 6561 - 256 = 6305 < 10000 3 8 − 2 8 = 6561 − 256 = 6305 < 10000 .
n = 9 n = 9 n = 9 : 3 9 − 2 9 = 19683 − 512 = 19171 > 10000 3^9 - 2^9 = 19683 - 512 = 19171 > 10000 3 9 − 2 9 = 19683 − 512 = 19171 > 10000 .
The smallest value is n = 9 n = 9 n = 9 .
Tests synthesis of sequences and series with other topics. Requires combining concepts from multiple units.
Question:
(a) Show that ∑ r = 1 n r n 2 = n ( n + 1 ) 2 n 2 \sum_{r=1}^{n} \frac{r}{n^2} = \frac{n(n+1)}{2n^2} ∑ r = 1 n n 2 r = 2 n 2 n ( n + 1 ) .
(b) Hence evaluate lim n → ∞ ∑ r = 1 n r n 2 \lim_{n \to \infty} \sum_{r=1}^{n} \frac{r}{n^2} lim n → ∞ ∑ r = 1 n n 2 r .
(c) By interpreting the limit in part (b) as a Riemann sum, identify the corresponding definite integral and verify your answer by direct integration.
(d) Use a similar approach to evaluate lim n → ∞ ∑ r = 1 n r 2 n 3 \lim_{n \to \infty} \sum_{r=1}^{n} \frac{r^2}{n^3} lim n → ∞ ∑ r = 1 n n 3 r 2 .
[Difficulty: hard. Connects summation to integration through Riemann sums, testing understanding of the Fundamental Theorem of Calculus.]
Solution:
(a) ∑ r = 1 n r n 2 = 1 n 2 ∑ r = 1 n r = 1 n 2 ⋅ n ( n + 1 ) 2 = n ( n + 1 ) 2 n 2 \sum_{r=1}^{n} \frac{r}{n^2} = \frac{1}{n^2}\sum_{r=1}^{n} r = \frac{1}{n^2} \cdot \frac{n(n+1)}{2} = \frac{n(n+1)}{2n^2} ∑ r = 1 n n 2 r = n 2 1 ∑ r = 1 n r = n 2 1 ⋅ 2 n ( n + 1 ) = 2 n 2 n ( n + 1 ) .
(b) lim n → ∞ n ( n + 1 ) 2 n 2 = lim n → ∞ n + 1 2 n = lim n → ∞ 1 + 1 / n 2 = 1 2 \lim_{n \to \infty} \frac{n(n+1)}{2n^2} = \lim_{n \to \infty} \frac{n+1}{2n} = \lim_{n \to \infty} \frac{1 + 1/n}{2} = \frac{1}{2} lim n → ∞ 2 n 2 n ( n + 1 ) = lim n → ∞ 2 n n + 1 = lim n → ∞ 2 1 + 1/ n = 2 1 .
(c) The sum ∑ r = 1 n r n 2 = ∑ r = 1 n r n ⋅ 1 n \sum_{r=1}^{n} \frac{r}{n^2} = \sum_{r=1}^{n} \frac{r}{n} \cdot \frac{1}{n} ∑ r = 1 n n 2 r = ∑ r = 1 n n r ⋅ n 1 is a Riemann sum for ∫ 0 1 x d x \int_0^1 x \, dx ∫ 0 1 x d x with n n n subdivisions, using right-endpoint evaluation (since x r = r / n x_r = r/n x r = r / n ).
Verification: ∫ 0 1 x d x = [ x 2 2 ] 0 1 = 1 2 \int_0^1 x \, dx = \left[\frac{x^2}{2}\right]_0^1 = \frac{1}{2} ∫ 0 1 x d x = [ 2 x 2 ] 0 1 = 2 1 . Confirmed.
(d) ∑ r = 1 n r 2 n 3 = ∑ r = 1 n ( r n ) 2 ⋅ 1 n \sum_{r=1}^{n} \frac{r^2}{n^3} = \sum_{r=1}^{n} \left(\frac{r}{n}\right)^2 \cdot \frac{1}{n} ∑ r = 1 n n 3 r 2 = ∑ r = 1 n ( n r ) 2 ⋅ n 1 .
This is a Riemann sum for ∫ 0 1 x 2 d x \int_0^1 x^2 \, dx ∫ 0 1 x 2 d x .
∫ 0 1 x 2 d x = [ x 3 3 ] 0 1 = 1 3 \int_0^1 x^2 \, dx = \left[\frac{x^3}{3}\right]_0^1 = \frac{1}{3} ∫ 0 1 x 2 d x = [ 3 x 3 ] 0 1 = 3 1 Algebraic verification: 1 n 3 ⋅ n ( n + 1 ) ( 2 n + 1 ) 6 = ( n + 1 ) ( 2 n + 1 ) 6 n 2 \frac{1}{n^3} \cdot \frac{n(n+1)(2n+1)}{6} = \frac{(n+1)(2n+1)}{6n^2} n 3 1 ⋅ 6 n ( n + 1 ) ( 2 n + 1 ) = 6 n 2 ( n + 1 ) ( 2 n + 1 ) .
lim n → ∞ ( n + 1 ) ( 2 n + 1 ) 6 n 2 = lim n → ∞ 2 n 2 + 3 n + 1 6 n 2 = 2 6 = 1 3 \lim_{n \to \infty} \frac{(n+1)(2n+1)}{6n^2} = \lim_{n \to \infty} \frac{2n^2 + 3n + 1}{6n^2} = \frac{2}{6} = \frac{1}{3} n → ∞ lim 6 n 2 ( n + 1 ) ( 2 n + 1 ) = n → ∞ lim 6 n 2 2 n 2 + 3 n + 1 = 6 2 = 3 1 Confirmed.
Question:
The function f f f is defined by f ( x ) = cos x f(x) = \cos x f ( x ) = cos x where x x x is in radians.
A sequence is defined by x 0 = 1 x_0 = 1 x 0 = 1 and x n + 1 = f ( x n ) = cos ( x n ) x_{n+1} = f(x_n) = \cos(x_n) x n + 1 = f ( x n ) = cos ( x n ) for n ≥ 0 n \geq 0 n ≥ 0 .
(a) Find x 1 x_1 x 1 , x 2 x_2 x 2 , x 3 x_3 x 3 And x 4 x_4 x 4 to 6 decimal places.
(b) Prove that the sequence ( x n ) (x_n) ( x n ) is convergent.
(c) The limit L L L satisfies L = cos L L = \cos L L = cos L . By considering the function g ( x ) = x − cos x g(x) = x - \cos x g ( x ) = x − cos x Show that L L L is the unique solution to this equation in [ 0 , π / 2 ] [0, \pi/2] [ 0 , π /2 ] .
(d) Use the Newton-Raphson method with starting value x 0 = 1 x_0 = 1 x 0 = 1 to find L L L to 8 decimal places.
[Difficulty: hard. Combines fixed-point iteration, convergence proofs, and the Newton-Raphson method.]
Solution:
(a) Using a calculator (radians):
x 1 = cos ( 1 ) = 0.540302 x_1 = \cos(1) = 0.540302 x 1 = cos ( 1 ) = 0.540302 x 2 = cos ( 0.540302 ) = 0.857553 x_2 = \cos(0.540302) = 0.857553 x 2 = cos ( 0.540302 ) = 0.857553 x 3 = cos ( 0.857553 ) = 0.654290 x_3 = \cos(0.857553) = 0.654290 x 3 = cos ( 0.857553 ) = 0.654290
x 4 = cos ( 0.654290 ) = 0.793480 x_4 = \cos(0.654290) = 0.793480 x 4 = cos ( 0.654290 ) = 0.793480 (b) To prove convergence, we use the contraction mapping theorem. We need ∣ f ′ ( x ) ∣ < 1 |f'(x)| < 1 ∣ f ′ ( x ) ∣ < 1 on the relevant interval.
f ′ ( x ) = − sin x f'(x) = -\sin x f ′ ( x ) = − sin x So ∣ f ′ ( x ) ∣ = ∣ sin x ∣ ≤ sin ( 1 ) ≈ 0.841 < 1 |f'(x)| = |\sin x| \leq \sin(1) \approx 0.841 < 1 ∣ f ′ ( x ) ∣ = ∣ sin x ∣ ≤ sin ( 1 ) ≈ 0.841 < 1 for all x ∈ [ 0 , 1 ] x \in [0, 1] x ∈ [ 0 , 1 ] .
Since x 0 = 1 ∈ [ 0 , 1 ] x_0 = 1 \in [0, 1] x 0 = 1 ∈ [ 0 , 1 ] and f f f maps [ 0 , 1 ] [0, 1] [ 0 , 1 ] into itself (because cos ( 0 ) = 1 ≤ 1 \cos(0) = 1 \leq 1 cos ( 0 ) = 1 ≤ 1 and cos ( 1 ) ≈ 0.54 ≥ 0 \cos(1) \approx 0.54 \geq 0 cos ( 1 ) ≈ 0.54 ≥ 0 ), and ∣ f ′ ( x ) ∣ ≤ k < 1 |f'(x)| \leq k < 1 ∣ f ′ ( x ) ∣ ≤ k < 1 for all x ∈ [ 0 , 1 ] x \in [0, 1] x ∈ [ 0 , 1 ] where k = sin 1 k = \sin 1 k = sin 1 The sequence converges by the Banach fixed-point theorem.
(c) g ( x ) = x − cos x g(x) = x - \cos x g ( x ) = x − cos x . Then g ( 0 ) = 0 − 1 = − 1 < 0 g(0) = 0 - 1 = -1 < 0 g ( 0 ) = 0 − 1 = − 1 < 0 and g ( π / 2 ) = π / 2 − 0 = π / 2 > 0 g(\pi/2) = \pi/2 - 0 = \pi/2 > 0 g ( π /2 ) = π /2 − 0 = π /2 > 0 .
By the intermediate value theorem, there exists L ∈ ( 0 , π / 2 ) L \in (0, \pi/2) L ∈ ( 0 , π /2 ) with g ( L ) = 0 g(L) = 0 g ( L ) = 0 .
For uniqueness: g ′ ( x ) = 1 + sin x > 0 g'(x) = 1 + \sin x > 0 g ′ ( x ) = 1 + sin x > 0 for all x ∈ [ 0 , π / 2 ] x \in [0, \pi/2] x ∈ [ 0 , π /2 ] (since sin x ≥ 0 \sin x \geq 0 sin x ≥ 0 in this interval). Therefore g g g is strictly increasing on [ 0 , π / 2 ] [0, \pi/2] [ 0 , π /2 ] So g ( x ) = 0 g(x) = 0 g ( x ) = 0 has at most one solution in this interval.
Combined: there is exactly one solution L ∈ ( 0 , π / 2 ) L \in (0, \pi/2) L ∈ ( 0 , π /2 ) .
(d) Newton-Raphson: x n + 1 = x n − g ( x n ) g ′ ( x n ) = x n − x n − cos x n 1 + sin x n x_{n+1} = x_n - \frac{g(x_n)}{g'(x_n)} = x_n - \frac{x_n - \cos x_n}{1 + \sin x_n} x n + 1 = x n − g ′ ( x n ) g ( x n ) = x n − 1 + s i n x n x n − c o s x n .
Starting with x 0 = 1 x_0 = 1 x 0 = 1 :
x 1 = 1 − 1 − cos 1 1 + sin 1 = 1 − 1 − 0.540302 1 + 0.841471 = 1 − 0.459698 1.841471 = 1 − 0.249649 = 0.750351 x_1 = 1 - \frac{1 - \cos 1}{1 + \sin 1} = 1 - \frac{1 - 0.540302}{1 + 0.841471} = 1 - \frac{0.459698}{1.841471} = 1 - 0.249649 = 0.750351 x 1 = 1 − 1 + sin 1 1 − cos 1 = 1 − 1 + 0.841471 1 − 0.540302 = 1 − 1.841471 0.459698 = 1 − 0.249649 = 0.750351 x 2 = 0.750351 − 0.750351 − cos ( 0.750351 ) 1 + sin ( 0.750351 ) = 0.750351 − 0.750351 − 0.731125 1 + 0.681676 = 0.750351 − 0.019226 1.681676 x_2 = 0.750351 - \frac{0.750351 - \cos(0.750351)}{1 + \sin(0.750351)} = 0.750351 - \frac{0.750351 - 0.731125}{1 + 0.681676} = 0.750351 - \frac{0.019226}{1.681676} x 2 = 0.750351 − 1 + sin ( 0.750351 ) 0.750351 − cos ( 0.750351 ) = 0.750351 − 1 + 0.681676 0.750351 − 0.731125 = 0.750351 − 1.681676 0.019226 = 0.750351 − 0.011434 = 0.738917 = 0.750351 - 0.011434 = 0.738917 = 0.750351 − 0.011434 = 0.738917 x 3 = 0.738917 − 0.738917 − 0.739067 1 + 0.673717 = 0.738917 − − 0.000150 1.673717 = 0.738917 + 0.000090 = 0.739007 x_3 = 0.738917 - \frac{0.738917 - 0.739067}{1 + 0.673717} = 0.738917 - \frac{-0.000150}{1.673717} = 0.738917 + 0.000090 = 0.739007 x 3 = 0.738917 − 1 + 0.673717 0.738917 − 0.739067 = 0.738917 − 1.673717 − 0.000150 = 0.738917 + 0.000090 = 0.739007 x 4 = 0.739007 − 0.739007 − 0.739085 1 + 0.673812 = 0.739007 − − 0.000078 1.673812 = 0.739007 + 0.000047 = 0.739054 x_4 = 0.739007 - \frac{0.739007 - 0.739085}{1 + 0.673812} = 0.739007 - \frac{-0.000078}{1.673812} = 0.739007 + 0.000047 = 0.739054 x 4 = 0.739007 − 1 + 0.673812 0.739007 − 0.739085 = 0.739007 − 1.673812 − 0.000078 = 0.739007 + 0.000047 = 0.739054 x 5 = 0.739054 − 0.739054 − 0.739085 1.673812 = 0.739054 + 0.000019 = 0.739073 x_5 = 0.739054 - \frac{0.739054 - 0.739085}{1.673812} = 0.739054 + 0.000019 = 0.739073 x 5 = 0.739054 − 1.673812 0.739054 − 0.739085 = 0.739054 + 0.000019 = 0.739073 x 6 = 0.739073 − 0.739073 − 0.739085 1.673813 = 0.739073 + 0.000007 = 0.739080 x_6 = 0.739073 - \frac{0.739073 - 0.739085}{1.673813} = 0.739073 + 0.000007 = 0.739080 x 6 = 0.739073 − 1.673813 0.739073 − 0.739085 = 0.739073 + 0.000007 = 0.739080 x 7 = 0.739080 − 0.739080 − 0.739085 1.673813 = 0.739080 + 0.000003 = 0.739083 x_7 = 0.739080 - \frac{0.739080 - 0.739085}{1.673813} = 0.739080 + 0.000003 = 0.739083 x 7 = 0.739080 − 1.673813 0.739080 − 0.739085 = 0.739080 + 0.000003 = 0.739083 x 8 = 0.739083 − 0.739083 − 0.739085 1.673813 = 0.739083 + 0.000001 = 0.739084 x_8 = 0.739083 - \frac{0.739083 - 0.739085}{1.673813} = 0.739083 + 0.000001 = 0.739084 x 8 = 0.739083 − 1.673813 0.739083 − 0.739085 = 0.739083 + 0.000001 = 0.739084 To 8 decimal places: L = 0.73908513 L = 0.73908513 L = 0.73908513 .
This is the Dottie number, the unique fixed point of the cosine function.
Question:
(a) Use the binomial theorem to expand ( 1 + 1 ) n (1 + 1)^n ( 1 + 1 ) n and hence show that:
∑ r = 0 n ( n r ) = 2 n \sum_{r=0}^{n} \binom{n}{r} = 2^n r = 0 ∑ n ( r n ) = 2 n (b) By differentiating the binomial expansion of ( 1 + x ) n (1 + x)^n ( 1 + x ) n and setting x = 1 x = 1 x = 1 Show that:
∑ r = 1 n r ( n r ) = n ⋅ 2 n − 1 \sum_{r=1}^{n} r\binom{n}{r} = n \cdot 2^{n-1} r = 1 ∑ n r ( r n ) = n ⋅ 2 n − 1 (c) Hence evaluate:
∑ r = 1 n r 2 ( n r ) \sum_{r=1}^{n} r^2 \binom{n}{r} r = 1 ∑ n r 2 ( r n ) [Difficulty: hard. Tests generating function techniques applied to combinatorial sums through differentiation of the binomial expansion.]
Solution:
(a) By the binomial theorem:
( 1 + 1 ) n = ∑ r = 0 n ( n r ) 1 n − r ⋅ 1 r = ∑ r = 0 n ( n r ) (1 + 1)^n = \sum_{r=0}^{n} \binom{n}{r} 1^{n-r} \cdot 1^r = \sum_{r=0}^{n} \binom{n}{r} ( 1 + 1 ) n = r = 0 ∑ n ( r n ) 1 n − r ⋅ 1 r = r = 0 ∑ n ( r n ) But ( 1 + 1 ) n = 2 n (1+1)^n = 2^n ( 1 + 1 ) n = 2 n . Therefore ∑ r = 0 n ( n r ) = 2 n \sum_{r=0}^{n} \binom{n}{r} = 2^n ∑ r = 0 n ( r n ) = 2 n .
(b) Start with ( 1 + x ) n = ∑ r = 0 n ( n r ) x r (1 + x)^n = \sum_{r=0}^{n} \binom{n}{r} x^r ( 1 + x ) n = ∑ r = 0 n ( r n ) x r .
Differentiating both sides with respect to x x x :
n ( 1 + x ) n − 1 = ∑ r = 0 n r ( n r ) x r − 1 = ∑ r = 1 n r ( n r ) x r − 1 n(1+x)^{n-1} = \sum_{r=0}^{n} r\binom{n}{r} x^{r-1} = \sum_{r=1}^{n} r\binom{n}{r} x^{r-1} n ( 1 + x ) n − 1 = r = 0 ∑ n r ( r n ) x r − 1 = r = 1 ∑ n r ( r n ) x r − 1 (Note: the r = 0 r = 0 r = 0 term vanishes.)
Setting x = 1 x = 1 x = 1 :
n ⋅ 2 n − 1 = ∑ r = 1 n r ( n r ) n \cdot 2^{n-1} = \sum_{r=1}^{n} r\binom{n}{r} n ⋅ 2 n − 1 = r = 1 ∑ n r ( r n ) (c) Start with n ( 1 + x ) n − 1 = ∑ r = 1 n r ( n r ) x r − 1 n(1+x)^{n-1} = \sum_{r=1}^{n} r\binom{n}{r} x^{r-1} n ( 1 + x ) n − 1 = ∑ r = 1 n r ( r n ) x r − 1 .
Multiply both sides by x x x :
n x ( 1 + x ) n − 1 = ∑ r = 1 n r ( n r ) x r nx(1+x)^{n-1} = \sum_{r=1}^{n} r\binom{n}{r} x^r n x ( 1 + x ) n − 1 = r = 1 ∑ n r ( r n ) x r Differentiate with respect to x x x :
n ( 1 + x ) n − 1 + n x ( n − 1 ) ( 1 + x ) n − 2 = ∑ r = 1 n r 2 ( n r ) x r − 1 n(1+x)^{n-1} + nx(n-1)(1+x)^{n-2} = \sum_{r=1}^{n} r^2\binom{n}{r} x^{r-1} n ( 1 + x ) n − 1 + n x ( n − 1 ) ( 1 + x ) n − 2 = r = 1 ∑ n r 2 ( r n ) x r − 1 Factor the left side:
n ( 1 + x ) n − 2 [ ( 1 + x ) + x ( n − 1 ) ] = n ( 1 + x ) n − 2 ( 1 + x + n x − x ) = n ( 1 + x ) n − 2 ( 1 + n x ) n(1+x)^{n-2}[(1+x) + x(n-1)] = n(1+x)^{n-2}(1 + x + nx - x) = n(1+x)^{n-2}(1 + nx) n ( 1 + x ) n − 2 [( 1 + x ) + x ( n − 1 )] = n ( 1 + x ) n − 2 ( 1 + x + n x − x ) = n ( 1 + x ) n − 2 ( 1 + n x ) Setting x = 1 x = 1 x = 1 :
n ⋅ 2 n − 2 ( 1 + n ) = ∑ r = 1 n r 2 ( n r ) n \cdot 2^{n-2}(1 + n) = \sum_{r=1}^{n} r^2\binom{n}{r} n ⋅ 2 n − 2 ( 1 + n ) = r = 1 ∑ n r 2 ( r n ) ∑ r = 1 n r 2 ( n r ) = n ( n + 1 ) ⋅ 2 n − 2 \sum_{r=1}^{n} r^2\binom{n}{r} = n(n+1) \cdot 2^{n-2} r = 1 ∑ n r 2 ( r n ) = n ( n + 1 ) ⋅ 2 n − 2 Verification for n = 3 n = 3 n = 3 : LHS = 1 ⋅ 3 + 4 ⋅ 3 + 9 ⋅ 1 = 3 + 12 + 9 = 24 = 1 \cdot 3 + 4 \cdot 3 + 9 \cdot 1 = 3 + 12 + 9 = 24 = 1 ⋅ 3 + 4 ⋅ 3 + 9 ⋅ 1 = 3 + 12 + 9 = 24 . RHS = 3 ⋅ 4 ⋅ 2 = 24 = 3 \cdot 4 \cdot 2 = 24 = 3 ⋅ 4 ⋅ 2 = 24 . Confirmed.
Pure Mathematics : Pure maths covers algebra, calculus, and functionsMechanics : Mechanics applies maths to physical problemsStatistics : Statistics develops data analysis methods