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: x2n – y2n is divisible by x + y.
Given an example of a statement P (n) such that it is true for all n ∈ N.
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
1.2 + 2.22 + 3.23 + ... + n.2n = (n − 1) 2n+1+2
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}\]
\[\frac{1}{2} + \frac{1}{4} + \frac{1}{8} + . . . + \frac{1}{2^n} = 1 - \frac{1}{2^n}\]
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
52n −1 is divisible by 24 for all n ∈ N.
52n+2 −24n −25 is divisible by 576 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
\[\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 .\]
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/(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:
3n − 2n − 1 is divisible by 4
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)`
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:
`sum_(t = 1)^(n - 1) t(t + 1) = (n(n - 1)(n + 1))/3`, for all natural numbers n ≥ 2.
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
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
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:
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:
n3 – n is divisible by 6, for each natural number n ≥ 2.
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:
2 + 4 + 6 + ... + 2n = n2 + n for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
Prove that for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
Prove that, sinθ + sin2θ + sin3θ + ... + sinnθ = `((sin ntheta)/2 sin ((n + 1))/2 theta)/(sin theta/2)`, 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 ______.
By using principle of mathematical induction for every natural number, (ab)n = ______.
