 鲜花( 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)
* }" P& L! V( u V9 G
' t+ G$ C& h0 b7 N" ^% }9 z4 `Proof: x# Z% D% C+ O2 j
Let n >1 be an integer 7 }% d7 D5 W7 `/ D1 c" P6 s: e
Basis: (n=2)4 ^. n* W3 I5 q2 }+ \( P5 L
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
7 s& `2 d) Z8 ^' c) }7 U1 a4 S+ E2 F4 a
Induction Hypothesis: Let K >=2 be integers, support that8 g4 _$ i Z% r. ]7 L0 n! E* v
K^3 – K can by divided by 3.9 x ^% R* V3 j1 r# e4 l5 [* `1 \
1 a# v A- v8 e% k- B9 oNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3" m9 C4 M @, Z4 k' ~3 L
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
/ q, G) J; w: L3 ^3 z$ `/ LThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)6 q$ i5 r/ X' d0 m1 K8 Q `
= K^3 + 3K^2 + 2K1 K* J! f9 r y1 N/ s
= ( K^3 – K) + ( 3K^2 + 3K)
1 {$ U+ y# o- G g" ?) l = ( K^3 – K) + 3 ( K^2 + K)4 d; m% V3 g1 o* I; H$ y4 j+ x
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
3 q6 @. m1 c% n9 [) g( ^- B) \So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
7 L$ f5 n8 T& U( y: F& A/ M9 ]3 x = 3X + 3 ( K^2 + K)# m4 s) W8 @/ D
= 3(X+ K^2 + K) which can be divided by 3
% T6 G$ i [: i# E$ ]% B0 l# A
! n' m. p4 ^. p4 p3 l+ Z; HConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
3 o/ o7 U$ i0 ^( `/ k
1 u' P& z. l; D0 f7 T! J[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|