हिंदी

If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.

Advertisements
Advertisements

प्रश्न

If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ ______.

रिक्त स्थान भरें
Advertisements

उत्तर

If P(n): 2n < n!, n ∈ N, then P(n) is true for all n ≥ 4.

Explanation:

Given that P(n): 2n < n!, ∀ n ∈ N

For n = 1

2 < 1   .....(Not true)

For n = 2

2 × 2 < 2! 

⇒ 4 < 2  ....(Not true)

For n = 3

2 × 3 < 3! 

⇒ 6 < 3.2.1 

⇒ 6 < 6   ....(Not true)

For n = 4

2 × 4 < 4! 

⇒ 8 < 4.3.2.1 

⇒ 8 < 24   .......(True)

For n = 5

2 × 5 < 5! 

⇒ 10 < 5.4.3.2.1 

⇒ 10 < 120   ......(True)

So, P(n) is the true for n ≥ 4.

shaalaa.com
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
अध्याय 4: Principle of Mathematical Induction - Exercise [पृष्ठ ७२]

APPEARS IN

एनसीईआरटी एक्झांप्लर Mathematics Exemplar [English] Class 11
अध्याय 4 Principle of Mathematical Induction
Exercise | Q 29 | पृष्ठ ७२

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

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

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

Prove the following by using the principle of mathematical induction for all n ∈ N: 1.2 + 2.22 + 3.22 + … + n.2n = (n – 1) 2n+1 + 2


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

`1^2 + 3^2 + 5^2 + ... + (2n -1)^2 = (n(2n - 1) (2n + 1))/3`

Prove the following by using the principle of mathematical induction for all n ∈ N: `1+2+ 3+...+n<1/8(2n +1)^2`


Prove the following by using the principle of mathematical induction for all n ∈ N: 102n – 1 + 1 is divisible by 11


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


If P (n) is the statement "n2 + n is even", and if P (r) is true, then P (r + 1) is true.

 

\[\frac{1}{3 . 7} + \frac{1}{7 . 11} + \frac{1}{11 . 5} + . . . + \frac{1}{(4n - 1)(4n + 3)} = \frac{n}{3(4n + 3)}\] 


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

 

a + ar + ar2 + ... + arn−1 =  \[a\left( \frac{r^n - 1}{r - 1} \right), r \neq 1\]

 

(ab)n = anbn for all n ∈ N. 

 

72n + 23n−3. 3n−1 is divisible by 25 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

 


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


\[\text{ Prove that } \cos\alpha + \cos\left( \alpha + \beta \right) + \cos\left( \alpha + 2\beta \right) + . . . + \cos\left[ \alpha + \left( n - 1 \right)\beta \right] = \frac{\cos\left\{ \alpha + \left( \frac{n - 1}{2} \right)\beta \right\}\sin\left( \frac{n\beta}{2} \right)}{\sin\left( \frac{\beta}{2} \right)} \text{ for all n } \in N .\]

 


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

 

\[\text { A sequence  } x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_1 = 2 \text{ and }  x_k = \frac{x_{k - 1}}{k} \text{ for all natural numbers } k, k \geq 2 . \text{ Show that }  x_n = \frac{2}{n!} \text{ for all } n \in N .\]


\[\text{ A sequence } x_0 , x_1 , x_2 , x_3 , . . . \text{ is defined by letting } x_0 = 5 and x_k = 4 + x_{k - 1}\text{  for all natural number k . } \]
\[\text{ Show that } x_n = 5 + 4n \text{ for all n }  \in N \text{ using mathematical induction .} \]


Prove by method of induction, for all n ∈ N:

12 + 32 + 52 + .... + (2n − 1)2 = `"n"/3 (2"n" − 1)(2"n" + 1)`


Prove by method of induction, for all n ∈ N:

1.3 + 3.5 + 5.7 + ..... to n terms = `"n"/3(4"n"^2 + 6"n" - 1)`


Prove by method of induction, for all n ∈ N:

(24n−1) is divisible by 15


Prove by method of induction, for all n ∈ N:

3n − 2n − 1 is divisible by 4


Prove by method of induction, for all n ∈ N:

(cos θ + i sin θ)n = 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:

Prove, by method of induction, for all n ∈ N

12 + 42 + 72 + ... + (3n − 2)2 = `"n"/2 (6"n"^2 - 3"n" - 1)`


Answer the following:

Given that tn+1 = 5tn − 8, t1 = 3, prove by method of induction that tn = 5n−1 + 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:

2n + 1 < 2n, for all natual numbers n ≥ 3.


The distributive law from algebra says that for all real numbers c, a1 and a2, we have c(a1 + a2) = ca1 + ca2.

Use this law and mathematical induction to prove that, for all natural numbers, n ≥ 2, if c, a1, a2, ..., an are any real numbers, then c(a1 + a2 + ... + an) = ca1 + ca2 + ... + can.


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 a1, a2, a3 ... is defined by letting a1 = 3 and ak = 7ak – 1 for all natural numbers k ≥ 2. Show that an = 3.7n–1 for all natural numbers.


Consider the statement: “P(n) : n2 – n + 41 is prime." Then which one of the following is true?


Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×