Advertisements
Advertisements
प्रश्न
If P (n) is the statement "n2 − n + 41 is prime", prove that P (1), P (2) and P (3) are true. Prove also that P (41) is not true.
Advertisements
उत्तर
\[P(n): n^2 - n + 41\text{ is prime } . \]
\[Now, \]
\[P(1) = 1^2 - 1 + 41 = 41 (\text{ prime} )\]
\[P(2) = 2^2 - 2 + 41 = 4 - 2 + 41 = 43 (\text{ prime} )\]
\[P(3) = 3^2 - 3 + 41 = 9 - 3 + 41 = 47 (\text{ prime } )\]
\[P(41) = {41}^2 - 41 + 41 = 1681 (\text{ not prime} )\]
\[\text{ Thus, we can say that P(1), P(2) and P(3) are true, but P(41) is not true } .\]
APPEARS IN
संबंधित प्रश्न
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:
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.4 + 1/4.7 + 1/7.10 + ... + 1/((3n - 2)(3n + 1)) = n/((3n + 1))`
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: x2n – y2n is divisible by x + y.
Prove the following by using the principle of mathematical induction for all n ∈ N: 41n – 14n is a multiple of 27.
If P (n) is the statement "2n ≥ 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.
1 + 3 + 32 + ... + 3n−1 = \[\frac{3^n - 1}{2}\]
\[\frac{1}{1 . 4} + \frac{1}{4 . 7} + \frac{1}{7 . 10} + . . . + \frac{1}{(3n - 2)(3n + 1)} = \frac{n}{3n + 1}\]
1.3 + 3.5 + 5.7 + ... + (2n − 1) (2n + 1) =\[\frac{n(4 n^2 + 6n - 1)}{3}\]
1.2 + 2.3 + 3.4 + ... + n (n + 1) = \[\frac{n(n + 1)(n + 2)}{3}\]
12 + 32 + 52 + ... + (2n − 1)2 = \[\frac{1}{3}n(4 n^2 - 1)\]
52n −1 is divisible by 24 for all n ∈ N.
32n+7 is divisible by 8 for all n ∈ N.
n(n + 1) (n + 5) is a multiple of 3 for all n ∈ N.
Prove that n3 - 7n + 3 is divisible by 3 for all n \[\in\] 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?
\[\frac{(2n)!}{2^{2n} (n! )^2} \leq \frac{1}{\sqrt{3n + 1}}\] for all n ∈ N .
Prove by method of induction, for all n ∈ N:
(23n − 1) is divisible by 7
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:
1 + 3 + 5 + ... + (2n – 1) = n2
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.
Prove statement by using the Principle of Mathematical Induction for all n ∈ N, that:
22n – 1 is divisible by 3.
Prove by induction that for all natural number n sinα + sin(α + β) + sin(α + 2β)+ ... + sin(α + (n – 1)β) = `(sin (alpha + (n - 1)/2 beta)sin((nbeta)/2))/(sin(beta/2))`
Let P(n): “2n < (1 × 2 × 3 × ... × n)”. Then the smallest positive integer for which P(n) is true is ______.
State whether the following proof (by mathematical induction) is true or false for the statement.
P(n): 12 + 22 + ... + n2 = `(n(n + 1) (2n + 1))/6`
Proof By the Principle of Mathematical induction, P(n) is true for n = 1,
12 = 1 = `(1(1 + 1)(2*1 + 1))/6`. Again for some k ≥ 1, k2 = `(k(k + 1)(2k + 1))/6`. Now we prove that
(k + 1)2 = `((k + 1)((k + 1) + 1)(2(k + 1) + 1))/6`
Prove the statement by using the Principle of Mathematical Induction:
For any natural number n, 7n – 2n is divisible by 5.
Prove the statement by using the Principle of Mathematical Induction:
n(n2 + 5) is divisible by 6, for each natural number n.
Prove that for all n ∈ N.
cos α + cos(α + β) + cos(α + 2β) + ... + cos(α + (n – 1)β) = `(cos(alpha + ((n - 1)/2)beta)sin((nbeta)/2))/(sin beta/2)`.
Prove that number of subsets of a set containing n distinct elements is 2n, for all n ∈ N.
For all n ∈ N, 3.52n+1 + 23n+1 is divisible by ______.
