Advertisements
Advertisements
प्रश्न
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
Advertisements
उत्तर
Let P(n) be the given statement.
Thus, we have .
\[P\left( n \right): \frac{\left( 2n \right)!}{2^{2n} \left( n! \right)^2} \leq \frac{1}{\sqrt{3n + 1}}\]
\[\text{ Step1} : \]
\[P(1): \frac{2!}{2^2 . 1} = \frac{1}{2} \leq \frac{1}{\sqrt{3 + 1}}\]
\[\text{ Thus, P(1) is true} . \]
\[\text{ Step2: } \]
\[\text{ Let P(m) be true .} \]
\[\text{ Thus, we have: } \]
\[\frac{\left( 2m \right)!}{2^{2m} \left( m! \right)^2} \leq \frac{1}{\sqrt{3m + 1}}\]
\[\text{ We need to prove that P(m + 1) is true .} \]
Now,
\[P(m + 1): \]
\[\frac{(2m + 2)!}{2^{2m + 2} \left( (m + 1)! \right)^2} = \frac{\left( 2m + 2 \right)\left( 2m + 1 \right)\left( 2m \right)!}{2^{2m} . 2^2 \left( m + 1 \right)^2 \left( m! \right)^2}\]
\[ \Rightarrow \frac{(2m + 2)!}{2^{2m + 2} \left( (m + 1)! \right)^2} \leq \frac{\left( 2m \right)!}{2^{2m} \left( m! \right)^2} \times \frac{\left( 2m + 2 \right)\left( 2m + 1 \right)}{2^2 \left( m + 1 \right)^2}\]
\[ \Rightarrow \frac{(2m + 2)!}{2^{2m + 2} \left( (m + 1)! \right)^2} \leq \frac{2m + 1}{2\left( m + 1 \right)\sqrt{3m + 1}}\]
\[\Rightarrow \frac{\left( 2m + 2 \right)!}{2^{2m + 2} \left( \left( m + 1 \right)! \right)^2} \leq \sqrt{\frac{\left( 2m + 1 \right)^2}{4 \left( m + 1 \right)^2 \left( 3m + 1 \right)}}\]
\[ \Rightarrow \frac{\left( 2m + 2 \right)!}{2^{2m + 2} \left( \left( m + 1 \right)! \right)^2} \leq \sqrt{\frac{\left( 4 m^2 + 4m + 1 \right) \times \left( 3m + 4 \right)}{4\left( 3 m^3 + 7 m^2 + 5m + 1 \right)\left( 3m + 4 \right)}}\]
\[ \Rightarrow \frac{\left( 2m + 2 \right)!}{2^{2m + 2} \left( \left( m + 1 \right)! \right)^2} \leq \sqrt{\frac{12 m^3 + 28 m^2 + 19m + 4}{\left( 12 m^3 + 28 m^2 + 20m + 4 \right)\left( 3m + 4 \right)}}\]
\[ \because \frac{12 m^3 + 28 m^2 + 19m + 4}{\left( 12 m^3 + 28 m^2 + 20m + 4 \right)} < 1\]
\[ \therefore \frac{\left( 2m + 2 \right)!}{2^{2m + 2} \left( \left( m + 1 \right)! \right)^2} < \frac{1}{\sqrt{3m + 4}}\]
Thus, P(m + 1) is true.
Hence, by mathematical induction
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] is true for all n ∈ N
APPEARS IN
संबंधित प्रश्न
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/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+ 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: `1+2+ 3+...+n<1/8(2n +1)^2`
Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11
If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
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)\] for n ≥ 2, where a > 0, A > 0.
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{ 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:
3 + 7 + 11 + ..... + to n terms = n(2n+1)
Prove by method of induction, for all n ∈ N:
12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
13 + 33 + 53 + .... to n terms = n2(2n2 − 1)
Prove by method of induction, for all n ∈ N:
1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`
Prove by method of induction, for all n ∈ N:
`1/(1.3) + 1/(3.5) + 1/(5.7) + ... + 1/((2"n" - 1)(2"n" + 1)) = "n"/(2"n" + 1)`
Prove by method of induction, for all n ∈ N:
(24n−1) is divisible by 15
Prove by method of induction, for all n ∈ N:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Answer the following:
Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 2
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:
`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:
22n – 1 is divisible by 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))`
A student was asked to prove a statement P(n) by induction. He proved that P(k + 1) is true whenever P(k) is true for all k > 5 ∈ N and also that P(5) is true. On the basis of this he could conclude that P(n) is true ______.
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`
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:
4n – 1 is divisible by 3, for each natural number n.
Prove the statement by using the Principle of Mathematical Induction:
2n < (n + 2)! for all natural number n.
Prove that `1/(n + 1) + 1/(n + 2) + ... + 1/(2n) > 13/24`, for all natural numbers n > 1.
By using principle of mathematical induction for every natural number, (ab)n = ______.
