Use Principle of MI to verify (i) If n in ZZ is a positive ineger then 2^n 3^(xn)-1 divisible by 17. (ii) For all positive integers n>=5, 2^k>k^2

hexacordoK

hexacordoK

Answered question

2020-12-27

Use Principle of MI to verify
(i) If nZ is a positive ineger then 2n3xn1 divisible by 17.
(ii) For all positive integers n5,
2k>k2

Answer & Explanation

Sally Cresswell

Sally Cresswell

Skilled2020-12-28Added 91 answers

According to the given information it is required to prove the following using principle of mathematical induction.
If nZ is a positive ineger then 2n32n1 divisible by 17.
that is: 2n32n1=xn9n1=18n1 is divisible by 17
For n = 1
18-1=17
17 is diviseble by 17
so, the statement is true for n=1
Let us assume that the given statement is true for n = k that is:
kZ is posisitve integer then 2k32k1=18k1 is divisible by 17
Now, prove that the statement is true for n = k+1:
So, consider
2n+132(n+1)1=2n232n1
=182n32n1
=172n32n+2n32n1
Now, since
172n32n is divisible by 17 and from assumption 2n32n1 is divisible by 17
hence, 2n+132(n+1)1 is diviseble by 17
Therefore, whenever n = k is true n = k+1 is true.
Therefore, it is true for all integers.

Do you have a similar question?

Recalculate according to your conditions!

Ask your question.
Get an expert answer.

Let our experts help you. Answer in as fast as 15 minutes.

Didn't find what you were looking for?