Answer the following: Prove by method of induction [3-41-1]n=[2n+1-4nn-2n+1],∀ n∈N - Mathematics and Statistics

Question

Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`

Sum

Solution

Let P(n) ≡ `[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)]`, for all n ∈ N.

Step 1:

For n = 1,

L.H.S. = `[(3, -4),(1, -1)]`

R.H.S. = `[(2(1) + 1, -4(1)),(1, -2(1) + 1)] = [(3, -4),(1, -1)]`

∴ L.H.S. = R.H.S. for n = 1

∴ P(1) is true

Step 2:

Let us assume that for some k ∈ N, P (k) is true.

i.e., `[(3, -4),(1, -1)]^"k" = [(2"k" + 1, -4"k"),("k", -2"k" + 1)]` ...(1)

Step 3:

To prove that P(k + 1) is true, i.e., to prove that

`[(3, -4),(1, -1)]^("k"+1) = [(2("k" + 1) + 1, -4("k" + 1)),(("k" + 1), -2("k" + 1) + 1)]`

Now, L.H.S. = `[(3, -4),(1, - 1)]^("k"+1) = [(3, -4),(1, -1)]^"k" [(3, -4),(1, -1)]`

= `[(2"k" + 1, -4"k"),("k", -2"k" + 1)] [(3, -4),(1, -1)]` ...[By (1)]

= `[(3(2"k" + 1) - 4"k", -4(2"k" + 1) + 4"k"),(3"k" - 2"k" + 1, -4"k" + 2"k" - 1)]`

= `[(2"k" + 3, -4"k" - 4),("k" + 1, -2"k" - 1)]`

= `[(2("k" + 1) + 1, -4("k" + 1)),("k" + 1, -2("k" + 1) + 1)]`

= R.H.S.

∴ P(k + 1) is true.

Step 4:

From all the above steps and by the principle of mathematical induction P(n) is true for all n ∈ N.

i.e., `[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)]`, for all n ∈ N.

shaalaa.com

Principle of Mathematical Induction

Is there an error in this question or solution?

Q II. (3)Q II. (2)Q II. (4)

Chapter 4: Methods of Induction and Binomial Theorem - Miscellaneous Exercise 4.2 [Page 85]

APPEARS IN

Balbharati Mathematics and Statistics 2 (Arts and Science) [English] Standard 11 Maharashtra State Board

Chapter 4 Methods of Induction and Binomial Theorem
Miscellaneous Exercise 4.2 | Q II. (3) | Page 85

RELATED QUESTIONS

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+ 3+...+n<1/8(2n +1)^2`

Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 3.

Prove the following by using the principle of mathematical induction for all n ∈ N: 3²ⁿ^{+ 2} – 8n– 9 is divisible by 8.

If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.

If P (n) is the statement "n² + n is even", and if P (r) is true, then P (r + 1) is true.

If P (n) is the statement "n² − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.

1² + 2² + 3² + ... + n² =\[\frac{n(n + 1)(2n + 1)}{6}\] .

1 + 3 + 3² + ... + 3ⁿ⁻¹ = \[\frac{3^n - 1}{2}\]

\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\]

\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]

1² + 3² + 5² + ... + (2n − 1)² = \[\frac{1}{3}n(4 n^2 - 1)\]

Prove that n³ - 7n + 3 is divisible by 3 for all n \[\in\] N .

Let P(n) be the statement : 2ⁿ ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ N?

\[1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\] for all n ≥ 2, n ∈ N

\[\text{ Prove that } \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ for all n } \in N .\]

\[\text{ 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) \text{ for } n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ 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} .\]

\[\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 .\]

\[\text { A sequence } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and } x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that } x_n = \frac{2}{n!} \text{ for all } n \in N .\]

\[\text{ Using principle of mathematical induction, prove that } \sqrt{n} < \frac{1}{\sqrt{1}} + \frac{1}{\sqrt{2}} + \frac{1}{\sqrt{3}} + . . . + \frac{1}{\sqrt{n}} \text{ for all natural numbers } n \geq 2 .\]

\[\text{ The distributive law from algebra states that for all real numbers} c, a_1 \text{ and } a_2 , \text{ we have } c\left( a_1 + a_2 \right) = c a_1 + c a_2 . \]
\[\text{ Use this law and mathematical induction to prove that, for all natural numbers, } n \geq 2, if c, a_1 , a_2 , . . . , a_n \text{ are any real numbers, then } \]
\[c\left( a_1 + a_2 + . . . + a_n \right) = c a_1 + c a_2 + . . . + c a_n\]

Prove by method of induction, for all n ∈ N:

1² + 2² + 3² + .... + n² = `("n"("n" + 1)(2"n" + 1))/6`

Prove by method of induction, for all n ∈ N:

1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`

Prove by method of induction, for all n ∈ N:

(2⁴ⁿ−1) is divisible by 15

Prove by method of induction, for all n ∈ N:

3ⁿ − 2n − 1 is divisible by 4

Answer the following:

Given that t_n+1 = 5t_n − 8, t₁ = 3, prove by method of induction that t_n = 5ⁿ⁻¹ + 2