हिंदी

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

Advertisements
Advertisements

प्रश्न

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

 
Advertisements

उत्तर

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
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 12: Mathematical Induction - Exercise 12.2 [पृष्ठ २८]

APPEARS IN

आरडी शर्मा Mathematics [English] Class 11
अध्याय 12 Mathematical Induction
Exercise 12.2 | Q 23 | पृष्ठ २८

वीडियो ट्यूटोरियलVIEW ALL [1]

संबंधित प्रश्न

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

1.3 + 3.5 + 5.7 + ...+(2n -1)(2n + 1) = `(n(4n^2 + 6n -1))/3`

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

1/1.2.3 + 1/2.3.4 + 1/3.4.5 + ...+ `1/(n(n+1)(n+2)) = (n(n+3))/(4(n+1) (n+2))`

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

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


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 "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.


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


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


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


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

 

1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]

 

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

 

\[\frac{n^7}{7} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{n^2}{2} - \frac{37}{210}n\] is a positive integer for all n ∈ N.  

 


\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer 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 ∈ 

 


x2n−1 + y2n−1 is divisible by x + y for all n ∈ N.

 

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

 


Prove that the number of subsets of a set containing n distinct elements is 2n, for all n \[\in\] N .

 

\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{  for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n }  \in N \text{ using mathematical induction .} \]


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:

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


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 52n − 22n is divisible by 3, for all n ∈ N


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

22n – 1 is divisible by 3.


Define the sequence a1, a2, a3 ... as follows:
a1 = 2, an = 5 an–1, for all natural numbers n ≥ 2.

Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula an = 2.5n–1 for all natural numbers.


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


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:

2n < (n + 2)! for all natural number n.


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 `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.


If xn – 1 is divisible by x – k, then the least positive integral value of k is ______.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×