English

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

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

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


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/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

`1/2.5 + 1/5.8 + 1/8.11 + ... + 1/((3n - 1)(3n + 2)) = n/(6n + 4)`

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

`a + ar + ar^2 + ... + ar^(n -1) = (a(r^n - 1))/(r -1)`

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: 41n – 14n is a multiple of 27.


If P (n) is the statement "2n ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.

 

1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]

 

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


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

 


\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\]  for all 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 .\]

 


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:

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


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

`1/(3.5) + 1/(5.7) + 1/(7.9) + ...` to n terms = `"n"/(3(2"n" + 3))`


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

(23n − 1) is divisible by 7


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

(24n−1) is divisible by 15


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)`


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

Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1


Answer the following:

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

2 + 3.2 + 4.22 + ... + (n + 1)2n–1 = n.2n 


Answer the following:

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


Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.


Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:

2n + 1 < 2n, for all natual numbers n ≥ 3.


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))`


Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.


Prove the statement by using the Principle of Mathematical Induction:

4n – 1 is divisible by 3, for each natural number n.


Prove the statement by using the Principle of Mathematical Induction:

n3 – 7n + 3 is divisible by 3, for all natural numbers n.


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.


Prove the statement by using the Principle of Mathematical Induction:

1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.


For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.


Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?


By using principle of mathematical induction for every natural number, (ab)n = ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×