Question
Question: The smallest positive integer *n*, for which \(n! < \left( \frac{n + 1}{2} \right)^{n}\) hold is...
The smallest positive integer n, for which n!<(2n+1)n hold is
1
2
3
4
2
Solution
Let P(n) : n!<(2n+1)n
Step I : For n = 2
⇒ 2!<(22+1)2
⇒ 2<49
⇒ 2<2.25 which is true. Therefore, P(2) is true.
Step II : Assume that P(k) is true, then p(k) : k!<(2k+1)k
Step III : For n = k + 1,
P(k+1):(k+1)!<(2k+2)k+1
⇒ k!<(2k+1)k
⇒(k+1)k!<2k(k+1)k+1
⇒(k+1)!<2k(k+1)k+1 …..(i) and
2k(k+1)k+1<(2k+2)k+1 …..(ii)
⇒ (k+1k+2)k+1>2 ⇒ [1+k+11]k+1>2
⇒1+(k+1)k+11+k+1C2(k+11)2+........>2
⇒1+1+k+1C2(k+11)2+......>2
Which is true, hence (ii) is true.
From (i) and (ii), (k+1)!<2k(k+1)k+1<(2k+2)k+1
⇒ (k+1)!<(2k+2)k+1
Hence P(k+1) is true. Hence by the principle of mathematical induction P(n) is true for all n∈N
Trick : By check option
(1) For n = 1, 1!<(21+1)1 ⇒ 1<1 which is wrong
(2) For n = 2, 2!<(23)2 ⇒ 2<49 which is correct
(3) For n = 3, 3!<(23+1)3 ⇒ 6 < 8 which is correct
(4) For n = 4, 4!<(24+1)4 ⇒ 24<(25)4
⇒ 24 < 39.0625 which is correct.
But smallest positive integer n is 2.