 鲜花( 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)) s) y2 c7 I' I7 q9 m
) C8 S+ m0 Y( F: R; j; r! xProof:
1 o' m$ K7 {9 p) fLet n >1 be an integer
" q- k, [2 e5 I3 h* i9 b( yBasis: (n=2)
8 n7 I+ h! |& Y6 N, B: }* M 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
6 D- F# ?% z* D& W/ W6 R4 P" L8 q5 u% `) E% U$ n% ]3 Y, B* h c0 ?
Induction Hypothesis: Let K >=2 be integers, support that) \ @+ @# r/ f( N; T
K^3 – K can by divided by 3.
8 H G! b% ]5 i6 q2 }# }% {; D% l
' I# A: ^. m& r6 z) ^4 {! }/ H4 Q" lNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
4 y5 M/ [) p; `( G( `8 h$ Lsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem8 X; b5 ^, S/ Y, `
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1), G) h! J! K3 ~$ U8 c
= K^3 + 3K^2 + 2K
5 N+ |& s( b5 ]; j+ j2 A' \2 f" | = ( K^3 – K) + ( 3K^2 + 3K)
7 c8 @! v9 V; _5 b6 J9 q7 T = ( K^3 – K) + 3 ( K^2 + K)
% L5 |! p' B$ ~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
% B/ H0 ~ M! E( }) jSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)5 b9 v6 P$ {+ i$ ~
= 3X + 3 ( K^2 + K)
# J' j/ @# n6 ~4 J6 M5 I+ ] p = 3(X+ K^2 + K) which can be divided by 3. F9 q7 r: Y, c q/ v" X' z
4 O+ A# a; Z7 t: }/ O* G
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
6 J1 P& P- ~( n% U) j6 @) M! J1 f- C2 S% T) Y
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|