Monday, June 18, 2018

College Algebra, Chapter 9, 9.5, Section 9.5, Problem 18

Prove that n3n+3 is divisible by 3 for all natural numbers n.

Let P(n) denote the statement n3n+3 is divisible by 3

Step 1: P(1) is true, since 131+3 is divisible by 3

Step 2: Suppose P(k) is true. Now


(k+1)3(k+1)+3=(k+1)[(k+1)21]+3=(k+1)[(k2+2k+1)1]+3=(k+1)(k2+2k)+3=k3+2k2+k2+2k+3=k3+3k2+2k+3=k3+3k2+(31)k+3=k3+3k2+3kk+3=[k3k+3]+3[k2+k]


By the induction hypothesis, k3k+3 is divisible by 3 and 3[k2+k] is clearly divisible by 3 because the statement is in multiple of 3.

So, P(k+1) follows from P(k). Thus, by the principle of mathematical induction P(n) holds for all n.

No comments:

Post a Comment