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.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:
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`
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:
Prove the following by using the principle of mathematical induction for all n ∈ N: 32n + 2 – 8n– 9 is divisible by 8.
If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.
12 + 22 + 32 + ... + n2 =\[\frac{n(n + 1)(2n + 1)}{6}\] .
\[\frac{1}{1 . 2} + \frac{1}{2 . 3} + \frac{1}{3 . 4} + . . . + \frac{1}{n(n + 1)} = \frac{n}{n + 1}\]
1 + 3 + 5 + ... + (2n − 1) = n2 i.e., the sum of first n odd natural numbers is n2.
\[\frac{1}{2 . 5} + \frac{1}{5 . 8} + \frac{1}{8 . 11} + . . . + \frac{1}{(3n - 1)(3n + 2)} = \frac{n}{6n + 4}\]
\[\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)}\]
a + ar + ar2 + ... + arn−1 = \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]
11n+2 + 122n+1 is divisible by 133 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{ 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) \text{ for } n \geq 2, \text{ where } a > 0, A > 0 . \]
\[\text{ 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 .\]
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:
1.2 + 2.3 + 3.4 + ..... + n(n + 1) = `"n"/3 ("n" + 1)("n" + 2)`
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.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
2n + 1 < 2n, for all natual numbers n ≥ 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.
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))`
Prove by the Principle of Mathematical Induction that 1 × 1! + 2 × 2! + 3 × 3! + ... + n × n! = (n + 1)! – 1 for all natural numbers n.
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:
2n < (n + 2)! for all natural number n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 2 + 22 + ... + 2n = 2n+1 – 1 for all natural numbers n.
Prove the statement by using the Principle of Mathematical Induction:
1 + 5 + 9 + ... + (4n – 3) = n(2n – 1) for all natural numbers n.
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.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
By using principle of mathematical induction for every natural number, (ab)n = ______.
