Show that for all integers n >1, n^3 - n can be divided by 3. (Note: n^3 stands for n*n*n)# @& o, p. S/ [" O2 b
9 i* s' |2 _3 T5 ?: d H' x' iProof: ( W( Y1 T0 \/ L+ k
Let n >1 be an integer # h1 {# l% c% b: v
Basis: (n=2) A' N6 t; D9 A) K
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3 9 a6 B4 a0 ?& U _& \6 @9 S2 J8 d' Q. I# T
Induction Hypothesis: Let K >=2 be integers, support that 9 M& G/ N- W( y; v6 p: Y3 B K^3 – K can by divided by 3. 9 p0 x9 `( o1 ]5 Y# t. Z7 e9 @ : F9 ^2 I; t1 h2 Y2 |Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3 & H& k: }$ z% F$ @since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem / ^4 Q& m8 ?8 x7 W# g% w& i! ZThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1) # _2 U- w) G! Z = K^3 + 3K^2 + 2K! B( ?' _3 \0 K* d
= ( K^3 – K) + ( 3K^2 + 3K) ! g2 }+ i. E, A2 U" }. s = ( K^3 – K) + 3 ( K^2 + K)) g8 F- {' ]: A% N- ^
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 ) j4 n) m o$ `So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K) " F. s: k- b+ g# L) o = 3X + 3 ( K^2 + K)8 u- A8 u- v& u; X7 J- A: L
= 3(X+ K^2 + K) which can be divided by 34 Q( _+ r# @; i) o" }+ p
" ^( Y _9 `% r8 S$ R" ^' g5 yConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1. . B+ x* J! X. b9 [0 T5 O& f) F1 a2 N) n1 R' x4 Q" W" ^; J
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ]