Mathematical Induction

2007-05-15 11:38 pm
Prove, by mathematical induction, that (3n+1)7^n-1 is divisible by 9 for all natural numbers n

回答 (1)

2007-05-16 12:40 am
✔ 最佳答案
When n=1, (3 x 1 + 1) x 7^1 - 1 = 4 x 7 -1 = 27 is divisible by 9
Therefore, n=1 is true.

Suppose n=k is true. => (3k+1)7^k-1 is divisible by 9.

Now let n=k+1. [3(k+1) + 1] x 7^(k+1) - 1
=(3k+3+1)7^(k+1) - 1
=3k x 7^k x 7 + 3 x 7^(k+1) + 7^k x 7 -1
=3k x 7^k + 6 x 3k x 7^k + 3 x 7^(k+1) + 7^k + 6 x 7^k - 1
=3k x 7^k + 7^k - 1 + 18 x k x 7^k + 21 x 7^k + 6 x 7^k
=(3k+1)7^k-1 + 18k x 7^k + 27 x 7^k

Since (3k+1)7^k-1 is divisible by 9, 18k x 7^k is divisible by 9, 27 x 7^k is divisible by 9,
Therefore, n=k+1 is true.

Therefore, by induction, (3n+1)7^n-1 is divisible by 9 for all natural numbers n.


收錄日期: 2021-04-13 00:29:00
原文連結 [永久失效]:
https://hk.answers.yahoo.com/question/index?qid=20070515000051KK01783

檢視 Wayback Machine 備份