Advertisements
Advertisements
Question
Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
Advertisements
Solution
\[Let p\left( n \right): 1 + 2 + 2^2 + . . . + 2^n = 2^{n + 1} - 1 \forall n \in N\]
\[\text{ Step I: For } n = 1, \]
\[LHS = 1 + 2^1 = 3\]
\[RHS = 2^{1 + 1} - 1 = 2^2 - 1 = 4 - 1 = 3\]
\[As, LHS = RHS\]
\[\text{ So, it is true for n } = 1 . \]
\[\text{ Step II: For n } = k, \]
\[\text{ Let } p\left( k \right): 1 + 2 + 2^2 + . . . + 2^k = 2^{k + 1} - 1\text{ be true } \forall k \in N\]
\[\text{ Step III: For } n = k + 1, \]
\[LHS = 1 + 2 + 2^2 + . . . + 2^k + 2^{k + 1} \]
\[ = 2^{k + 1} - 1 + 2^{k + 1} \left(\text{ Using step } II \right)\]
\[ = 2 \times 2^{k + 1} - 1\]
\[ = 2^{k + 1 + 1} - 1\]
\[ = 2^{k + 2} - 1\]
\[RHS = 2^\left( k + 1 \right) + 1 - 1 = 2^{k + 2} - 1\]
\[As, LHS = RHS\]
\[\text{ So, it is also true for n } = k + 1 .\]
Hence, 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n \[\in\] N .
APPEARS IN
RELATED QUESTIONS
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1 + 3 + 3^2 + ... + 3^(n – 1) =((3^n -1))/2`
Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2.3 + 2.3.4 + … + n(n + 1) (n + 2) = `(n(n+1)(n+2)(n+3))/(4(n+3))`
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N:
1.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/3]`
Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2
Prove the following by using the principle of mathematical induction for all n ∈ N: `1/2 + 1/4 + 1/8 + ... + 1/2^n = 1 - 1/2^n`
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N:
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
Prove the following by using the principle of mathematical induction for all n ∈ N: x2n – y2n is divisible by x + y.
If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
(ab)n = anbn for all n ∈ N.
2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.
Given \[a_1 = \frac{1}{2}\left( a_0 + \frac{A}{a_0} \right), a_2 = \frac{1}{2}\left( a_1 + \frac{A}{a_1} \right) \text{ and } a_{n + 1} = \frac{1}{2}\left( a_n + \frac{A}{a_n} \right)\] for n ≥ 2, where a > 0, A > 0.
Prove that \[\frac{a_n - \sqrt{A}}{a_n + \sqrt{A}} = \left( \frac{a_1 - \sqrt{A}}{a_1 + \sqrt{A}} \right) 2^{n - 1}\]
Show by the Principle of Mathematical induction that the sum Sn of then terms of the series \[1^2 + 2 \times 2^2 + 3^2 + 2 \times 4^2 + 5^2 + 2 \times 6^2 + 7^2 + . . .\] is given by \[S_n = \binom{\frac{n \left( n + 1 \right)^2}{2}, \text{ if n is even} }{\frac{n^2 \left( n + 1 \right)}{2}, \text{ if n is odd } }\]
\[\text{ A sequence } a_1 , a_2 , a_3 , . . . \text{ is defined by letting } a_1 = 3 \text{ and } a_k = 7 a_{k - 1} \text{ for all natural numbers } k \geq 2 . \text{ Show that } a_n = 3 \cdot 7^{n - 1} \text{ for all } n \in N .\]
Prove by method of induction, for all n ∈ N:
3 + 7 + 11 + ..... + to n terms = n(2n+1)
Prove by method of induction, for all n ∈ N:
1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`
Prove by method of induction, for all n ∈ N:
3n − 2n − 1 is divisible by 4
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Answer the following:
Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 2.
The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.
Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.
State whether the following proof (by mathematical induction) is true or false for the statement.
P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`
Proof By the Principle of Mathematical induction, P(n) is true for n = 1,
12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that
(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`
Prove the statement by using the Principle of Mathematical Induction:
32n – 1 is divisible by 8, for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, 7n – 2n is divisible by 5.
Prove the statement by using the Principle of Mathematical Induction:
n3 – n is divisible by 6, for each natural number n ≥ 2.
Prove the statement by using the Principle of Mathematical Induction:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
A sequence d1, d2, d3 ... is defined by letting d1 = 2 and dk = `(d_(k - 1))/"k"` for all natural numbers, k ≥ 2. Show that dn = `2/(n!)` for all n ∈ N.
Prove that for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
By using principle of mathematical induction for every natural number, (ab)n = ______.
