English

(Ab)N = Anbn for All N ∈ N.

Advertisements
Advertisements

Question

(ab)n = anbn for all n ∈ N. 

 
Advertisements

Solution

Let P(n) be the given statement.
Now, 

\[P(n): (ab )^n = a^n b^n \text{ for all } n \in N . \]
\[\text{ Step } 1: \]
\[P(1): (ab )^1 = a^1 b^1 = ab\]
\[\text{ Thus, P(1) is true }  . \]
\[\text{ Step 2 } : \]
\[\text{ Let P(m) be true } . \]
\[\text{ Then } , \]
\[(ab )^m = a^m b^m \]
\[ \text{ We need to show that P(m + 1) is true whenever P(m) is true }  . \]
\[\text{ Now, }  \]
\[ P(m + 1): (ab )^{m + 1} = (ab )^m . ab\]
\[ = a^m b^m . ab\]
\[ = a^m a . b^m b\]
\[ = a^{m + 1} b^{m + 1} \]
\[\text{ Hence, P(m + 1) is true .}  \]
\[\text{ By the principle of mathematical induction, P(n) is true for all n }  \in N .\]

shaalaa.com
  Is there an error in this question or solution?
Chapter 12: Mathematical Induction - Exercise 12.2 [Page 28]

APPEARS IN

R.D. Sharma Mathematics [English] Class 11
Chapter 12 Mathematical Induction
Exercise 12.2 | Q 23 | Page 28

Video TutorialsVIEW ALL [1]

RELATED QUESTIONS

Prove the following by using the principle of mathematical induction for all n ∈ N: 

`1^3 +  2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^2`


Prove the following by using the principle of mathematical induction for all n ∈ N: 

`1+ 1/((1+2)) + 1/((1+2+3)) +...+ 1/((1+2+3+...n)) = (2n)/(n +1)`

Prove the following by using the principle of mathematical induction for all n ∈ N: 

`1^2 + 3^2 + 5^2 + ... + (2n -1)^2 = (n(2n - 1) (2n + 1))/3`

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 "n(n + 1) is even", then what is P(3)?


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 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]

 

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

 


\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 3)}\]


1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]

 

12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]

 

a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]

 


52n −1 is divisible by 24 for all n ∈ N.


32n+7 is divisible by 8 for all n ∈ N.

 

52n+2 −24n −25 is divisible by 576 for all n ∈ N.

 

2.7n + 3.5n − 5 is divisible by 24 for all n ∈ N.


Prove that 1 + 2 + 22 + ... + 2n = 2n+1 - 1 for all n  \[\in\] N .

 

x2n−1 + y2n−1 is divisible by x + y for all n ∈ 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} .\]


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

12 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`


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

(23n − 1) is divisible by 7


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

(cos θ + i sin θ)n = cos (nθ) + i sin (nθ)


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

`[(1, 2),(0, 1)]^"n" = [(1, 2"n"),(0, 1)]` ∀ n ∈ N


Answer the following:

Prove by method of induction loga xn = n logax, x > 0, n ∈ N


Answer the following:

Prove by method of induction 152n–1 + 1 is divisible by 16, for all n ∈ N.


Answer the following:

Prove by method of induction 52n − 22n is divisible by 3, for all n ∈ N


Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`


Give an example of a statement P(n) which is true for all n ≥ 4 but P(1), P(2) and P(3) are not true. Justify your answer


Give an example of a statement P(n) which is true for all n. Justify your answer. 


Prove the statement by using the Principle of Mathematical Induction:

n2 < 2n for all natural numbers n ≥ 5.


Prove the statement by using the Principle of Mathematical Induction:

`sqrt(n) < 1/sqrt(1) + 1/sqrt(2) + ... + 1/sqrt(n)`, for all natural numbers n ≥ 2.


A sequence a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.


A sequence b0, b1, b2 ... is defined by letting b0 = 5 and bk = 4 + bk – 1 for all natural numbers k. Show that bn = 5 + 4n for all natural number n using mathematical induction.


Prove that, cosθ cos2θ cos22θ ... cos2n–1θ = `(sin 2^n theta)/(2^n sin theta)`, for all n ∈ N.


Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×