Prove by using the principle of mathematical induction 3n < 4n for all n N.
Asked by Topperlearning User | 4th Jun, 2014, 01:23: PM
Let P(n): 3n < 4n for all n N.
P(1): 3 < 4, which is true. Thus P(n) is true for n = 1.
Let P(k) be true for some natural number k
i.e. 3k < 4k
Now we prove that P(k +1) is true whenever P(k) is true.
Thus P(k +1) is true whenever P(k) is true.
By principle mathematical induction 3n < 4n for all n N.
Answered by | 4th Jun, 2014, 03:23: PM
- Q-6 in the image
- Prove 10th by mathatical induction
- Prove by using the principle of mathematical induction 32n – 1 is divisible by 8 for n N.
- Prove by using the principle of mathematical induction n(n + 1)(n + 2) is divisible by 6 for all n N.
- If P(n) is the statement ‘22n – 1 is multiple of 3’ then show that P(5) is true.
- Let P(n) be the statement," n3 + n is divisible by 3". Check whether P(3) and P(4) is true.
- If P(n) is the statement 72n + 23n - 3.3n - 1 is divisible by 25 for all n N, then what is P(k + 1)?
- Show that if statement P(n): 2 + 4 + 6 + --- + 2n = n( n + 1) + 2 is true for n = k, then it is also true for n = k + 1. Can we apply the principle of mathematical induction?
- Prove that 102n – 1 + 1 is divisible by 11 for all n N.
Kindly Sign up for a personalised experience
- Ask Study Doubts
- Sample Papers
- Past Year Papers
- Textbook Solutions
Verify mobile number
Enter the OTP sent to your number