Advertisements
Advertisements
Question
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
Advertisements
Solution
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
RELATED QUESTIONS
Prove the following by using the principle of mathematical induction for all n ∈ N:
`1^3 + 2^3 + 3^3 + ... + n^3 = ((n(n+1))/2)^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.2 + 2.3 + 3.4+ ... + n(n+1) = `[(n(n+1)(n+2))/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+ 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: `1+2+ 3+...+n<1/8(2n +1)^2`
\[\frac{1}{3 . 5} + \frac{1}{5 . 7} + \frac{1}{7 . 9} + . . . + \frac{1}{(2n + 1)(2n + 3)} = \frac{n}{3(2n + 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}\]
32n+7 is divisible by 8 for all n ∈ N.
32n+2 −8n − 9 is divisible by 8 for all n ∈ N.
(ab)n = anbn for all n ∈ N.
72n + 23n−3. 3n−1 is divisible by 25 for all n ∈ N.
11n+2 + 122n+1 is divisible by 133 for all n ∈ N.
7 + 77 + 777 + ... + 777 \[{. . . . . . . . . . .}_{n - \text{ digits } } 7 = \frac{7}{81}( {10}^{n + 1} - 9n - 10)\]
Let P(n) be the statement : 2n ≥ 3n. If P(r) is true, show that P(r + 1) is true. Do you conclude that P(n) is true for all n ∈ 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 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 + 22 + 32 + .... + n2 = `("n"("n" + 1)(2"n" + 1))/6`
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:
5 + 52 + 53 + .... + 5n = `5/4(5^"n" - 1)`
Prove by method of induction, for all n ∈ N:
Given that tn+1 = 5tn + 4, t1 = 4, prove that tn = 5n − 1
Answer the following:
Prove, by method of induction, for all n ∈ N
8 + 17 + 26 + … + (9n – 1) = `"n"/2(9"n" + 7)`
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:
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.
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:
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.
Show that `n^5/5 + n^3/3 + (7n)/15` is a natural number for all n ∈ N.
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.
By using principle of mathematical induction for every natural number, (ab)n = ______.
