 鲜花( 53)  鸡蛋( 0)
|
This can by done by Induction
Show that for all integers n >1, n^3 - n can be divided by 3. (Note: n^3 stands for n*n*n)$ `9 `: `, z8 U1 Z
) ~- \( s2 K9 Z7 R5 R% ?
Proof: ' M2 ~! e7 d& W- R4 z" X0 n4 H$ S
Let n >1 be an integer 1 d* l4 ]# s g/ _! j1 S4 A
Basis: (n=2)
: ^2 o$ u* @; w 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
% b! \' `6 c2 z5 a8 F: N6 e0 s
' H3 k+ W9 l# ^$ z |Induction Hypothesis: Let K >=2 be integers, support that
9 J" y$ r j9 v0 P9 p K^3 – K can by divided by 3.
! F2 l' Z8 W6 n4 J/ B- x! W2 x: A8 ?. F c5 I8 [+ _; t
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
6 d8 W6 h U5 w; V1 x* o* A! [since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem; ]& K$ N- V% i# n. X' u/ v' C% s
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)* _8 L/ @! c+ |) P) X
= K^3 + 3K^2 + 2K
" d$ x2 t. q: e# y" k, C q = ( K^3 – K) + ( 3K^2 + 3K)' M: C8 S- N( C ]) _% V
= ( K^3 – K) + 3 ( K^2 + K)
6 o* y8 Y8 ^ Z7 @by Induction Hypothesis, we know that k^3 – k can by divided by 3 which means that k^3 – k = 3 X for some integer X>0
: m' s, [, V. z* g' eSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)7 R9 r2 ?3 W8 B4 }7 g1 ]
= 3X + 3 ( K^2 + K), d3 D' R1 r& J' [) D) q$ g
= 3(X+ K^2 + K) which can be divided by 3
2 A6 c/ d7 m1 x2 ]- Y# _( _ }
. T5 Y( C' h" z$ q2 sConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
B5 ^; ?: a/ \% T% p" T
8 t# }1 v* o* Q- R5 y$ \' N[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|