मराठी

X2n−1 + Y2n−1 is Divisible by X + Y for All N ∈ N. - Mathematics

Advertisements
Advertisements

प्रश्न

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

 
Advertisements

उत्तर

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

\[P(n): x^{2n - 1} + y^{2n - 1} \text{ is divisible by }  x + y . \]
\[\text{ Step1:}  \]
\[P(1): x^{2 - 1} + y^{2 - 1} = x + y \text{ is divisible by } x + y\]
\[\text{ Step2: } \]
\[\text{ Let P(m) be true } . \]
\[\text{ Also } , \]
\[ x^{2m - 1} + y^{2m - 1} \text{ is divisible by } x + y . \]
\[\text{ Suppose:}  \]
\[ x^{2m - 1} + y^{2m - 1} = \lambda\left( x + y \right) \text{ where}  \lambda \in N . . . (1)\]
\[\text{ We shall show that } P\left( m + 1 \right) \text{ is true whenever } P\left( m \right) \text{ is true }  . \]
\[\text{ Now } , \]
\[P\left( m + 1 \right) = x^{2m + 1} + y^{2m + 1} \]
\[ = x^{2m + 1} + y^{2m + 1} - x^{2m - 1} . y^2 + x^{2m - 1} . y^2 \]
\[ = x^{2m - 1} \left( x^2 - y^2 \right) + y^2 \left( x^{2m - 1} + y^{2m - 1} \right) \left[ \text{ From } (1) \right]\]
\[ = x^{2m - 1} \left( x^2 - y^2 \right) + y^2 . \lambda\left( x + y \right) \]
\[ = \left( x + y \right)\left( x^{2m - 1} \left( x - y \right) + \lambda y^2 \right) [\text{ It is divisible by } (x + y) . ]\]
\[\text{ Thus, } P\left( m + 1 \right) \text{ 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 38 | पृष्ठ २८

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

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

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

 

Given an example of a statement P (n) such that it is true for all n ∈ N.

 

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}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\] 


1.2 + 2.22 + 3.23 + ... + n.2= (n − 1) 2n+1+2

 

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

 


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

 

32n+2 −8n − 9 is divisible by 8 for all n ∈ 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.  

 


\[\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{ Let } P\left( n \right) \text{ be the statement } : 2^n \geq 3n . \text{ If } P\left( r \right) \text{ is true, then show that } P\left( r + 1 \right) \text{ is true . Do you conclude that } P\left( n \right)\text{  is true for all n }  \in N?\]


Prove that the number of subsets of a set containing n distinct elements is 2n, 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:

(24n−1) is divisible by 15


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

12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`


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 statement by using the Principle of Mathematical Induction for all n ∈ N, that:

1 + 3 + 5 + ... + (2n – 1) = n2 


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. 


Show by the Principle of Mathematical Induction that the sum Sn of the n term of the series 12 + 2 × 22 + 32 + 2 × 42 + 52 + 2 × 62 ... is given by

Sn = `{{:((n(n + 1)^2)/2",",  "if n is even"),((n^2(n + 1))/2",",  "if n is odd"):}`


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:

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


Prove the statement by using the Principle of Mathematical Induction:

For any natural number n, xn – yn is divisible by x – y, where x and y are any integers with x ≠ y.


Prove the statement by using the Principle of Mathematical Induction:

n(n2 + 5) is divisible by 6, for each natural number n.


Prove the statement by using the Principle of Mathematical Induction:

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


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.


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.


If 10n + 3.4n+2 + k is divisible by 9 for all n ∈ N, then the least positive integral value of k is ______.


State whether the following statement is true or false. Justify.

Let P(n) be a statement and let P(k) ⇒ P(k + 1), for some natural number k, then P(n) is true for all n ∈ N.


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×