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.

Question

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.

Solution

Let P(n) be the statement 3n < n!.

For n = 1,

3n = 3 × 1 = 3

n! = 1! = 1

Now, 3 > 1

So, P(1) is not true.

For n = 2,

3n = 3 × 2 = 6

n! = 2! = 2

Now, 6 > 2

So, P(2) is not true.

For n = 3,

3n = 3 × 3 = 9

n! = 3! = 6

Now, 9 > 6

So, P(3) is not true.

For n = 4,

3n = 3 × 4 = 12

n! = 4! = 24

Now, 12 < 24

So, P(4) is true.

For n = 5,

3n = 3 × 5 = 15

n! = 5! = 120

Now, 15 < 120

So, P(5) is true.

Similarly, it can be verified that 3n < n! for n = 6, 7, 8, ... .
Thus, the statement P(n) : 3n < n! is true for all n ≥ 4 but P(1), P(2) and P(3) are not true.

shaalaa.com

Principle of Mathematical Induction

Is there an error in this question or solution?

Q 7 Q 6 Q 1

Chapter 12: Mathematical Induction - Exercise 12.1 [Page 3]

APPEARS IN

R.D. Sharma Mathematics [English] Class 11

Chapter 12 Mathematical Induction
Exercise 12.1 | Q 7 | Page 3

Video TutorialsVIEW ALL [1]

view
Video Tutorials For All Subjects
Principle of Mathematical Induction

video tutorial00:17:42

RELATED QUESTIONS

Prove the following by using the principle of mathematical induction for all n ∈ N:

`1+ 1/((1+2)) + 1/((1+2+3)) +...+ 1/((1+2+3+...n)) = (2n)/(n +1)`

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:

(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.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`

If P (n) is the statement "2ⁿ ≥ 3n" and if P (r) is true, prove that P (r + 1) is true.

Given an example of a statement P (n) such that it is true for all n ∈ N.

If P (n) is the statement "n² − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.

1² + 2² + 3² + ... + n² =\[\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) = n² i.e., the sum of first n odd natural numbers is n².

1.3 + 2.4 + 3.5 + ... + n. (n + 2) = \[\frac{1}{6}n(n + 1)(2n + 7)\]

3²ⁿ⁺² −8n − 9 is divisible by 8 for all n ∈ N.

n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.

2.7ⁿ + 3.5ⁿ − 5 is divisible by 24 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}\]

\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .

\[1 + \frac{1}{4} + \frac{1}{9} + \frac{1}{16} + . . . + \frac{1}{n^2} < 2 - \frac{1}{n}\] for all n ≥ 2, n ∈ N

Show by the Principle of Mathematical induction that the sum S_n 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 } }\]

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

1² + 4² + 7² + ... + (3n − 2)² = `"n"/2 (6"n"^2 - 3"n" - 1)`

Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "n" ∈ "N"`

Answer the following:

Prove by method of induction log_a xⁿ = n log_ax, x > 0, 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:

`(1 - 1/2^2).(1 - 1/3^2)...(1 - 1/n^2) = (n + 1)/(2n)`, for all natural numbers, n ≥ 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 ______.