0
16kviews
Prove that 8n3n is a multiple of 5 by mathematical Induction, n>=1.

Mumbai University > Computer Engineering > Sem 3 > Discrete Structures

Marks: 5 Marks

Year: May 2014

1 Answer
2
3.6kviews

Step1: Basis of induction

For n=1

We have

8n3n=83=5 is divisible by 5

Step2: Induction step: Assume that 8k3k is divisible by 5. Then we have

8k+13k+1=8k.83k.3=8k.(5+3)3k+1=5(8k)+3(8k)3k+1=5(8k)+3(8k3k)

Since both forms in this sum are multiples of 5 (the first because it is 5 times an integer and the second by the assumption of the induction step), it follows that 8k+13k+1 is also multiple of 5. Thus, by the principle of mathematical induction, 8n3n is a multiple of 5.

Please log in to add an answer.