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.

प्रश्न

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.

उत्तर

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

क्या इस प्रश्न या उत्तर में कोई त्रुटि है?

Q 7 Q 6 Q 1

अध्याय 12: Mathematical Induction - Exercise 12.1 [पृष्ठ ३]

APPEARS IN

आर.डी. शर्मा Mathematics [English] Class 11

अध्याय 12 Mathematical Induction
Exercise 12.1 | Q 7 | पृष्ठ ३

वीडियो ट्यूटोरियलVIEW ALL [1]

view
वीडियो ट्यूटोरियल For All Subjects
Principle of Mathematical Induction

video tutorial00:17:42

संबंधित प्रश्न

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

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

1/1.2.3 + 1/2.3.4 + 1/3.4.5 + ...+ `1/(n(n+1)(n+2)) = (n(n+3))/(4(n+1) (n+2))`

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

`a + ar + ar^2 + ... + ar^(n -1) = (a(r^n - 1))/(r -1)`

Prove the following by using the principle of mathematical induction for all n ∈ N: n (n + 1) (n + 5) is a multiple of 3.

Prove the following by using the principle of mathematical induction for all n ∈ N (2n +7) < (n + 3)²

If P (n) is the statement "n3 + n is divisible by 3", prove that P (3) is true but P (4) is not true.

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

1² + 3² + 5² + ... + (2n − 1)² = \[\frac{1}{3}n(4 n^2 - 1)\]

a + (a + d) + (a + 2d) + ... (a + (n − 1) d) = \[\frac{n}{2}\left[ 2a + (n - 1)d \right]\]

5²ⁿ −1 is divisible by 24 for all n ∈ N.

\[\frac{n^7}{7} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{n^2}{2} - \frac{37}{210}n\] is a positive integer for all n ∈ N.

\[\frac{n^{11}}{11} + \frac{n^5}{5} + \frac{n^3}{3} + \frac{62}{165}n\] is a positive integer for all n ∈ N.

\[\frac{1}{2}\tan\left( \frac{x}{2} \right) + \frac{1}{4}\tan\left( \frac{x}{4} \right) + . . . + \frac{1}{2^n}\tan\left( \frac{x}{2^n} \right) = \frac{1}{2^n}\cot\left( \frac{x}{2^n} \right) - \cot x\] for all n ∈ N and \[0 < x < \frac{\pi}{2}\]

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

\[\sin x + \sin 3x + . . . + \sin (2n - 1)x = \frac{\sin^2 nx}{\sin x}\]

\[\text{ Prove that } \frac{1}{n + 1} + \frac{1}{n + 2} + . . . + \frac{1}{2n} > \frac{13}{24}, \text{ for all natural numbers } n > 1 .\]

Prove that the number of subsets of a set containing n distinct elements is 2ⁿ, for all n \[\in\] N .

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 by method of induction, for all n ∈ N:

(cos θ + i sin θ)ⁿ = cos (nθ) + i sin (nθ)

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:

Given that t_n+1 = 5t_n − 8, t₁ = 3, prove by method of induction that t_n = 5ⁿ⁻¹ + 2

Answer the following:

Prove by method of induction

`[(3, -4),(1, -1)]^"n" = [(2"n" + 1, -4"n"),("n", -2"n" + 1)], ∀ "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.

Define the sequence a₁, a₂, a₃ ... as follows:
a₁= 2, a_n = 5 a_n–1, for all natural numbers n ≥ 2.

Use the Principle of Mathematical Induction to show that the terms of the sequence satisfy the formula a_n = 2.5^n–1 for all natural numbers.

Let P(n): “2ⁿ < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.