 鲜花( 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. n( I/ t& s: u- H y, i |3 ?- g! F$ c
Proof:
& v1 {: h7 g3 e5 v0 Z/ U7 rLet n >1 be an integer
; J6 E: V9 M. g7 h, z9 I EBasis: (n=2)) u- \% P, b' s) d( u4 ?
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
4 {) X, H; p k) n( {1 T* K* a# J/ p! H7 z; @# Q+ z
Induction Hypothesis: Let K >=2 be integers, support that! V, X5 }# k$ P) O4 L# D
K^3 – K can by divided by 3.- h: y+ z d) c! M- [" o0 F* p; ?( ]
# g2 X- F- N: MNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
4 B% ]# j6 t& |4 C7 e9 w [* fsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem( J7 F0 V+ `7 |2 h1 C+ y
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
% S4 H2 Z# W* `" Q% g1 y = K^3 + 3K^2 + 2K2 ~( V% @& D& B: k- f Q6 I0 u
= ( K^3 – K) + ( 3K^2 + 3K) n, W5 k5 v* a3 T2 a! }7 R
= ( K^3 – K) + 3 ( K^2 + K)
2 `4 \5 }) o p" D& yby 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! ]) @1 ^& I; v( c0 {
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
9 [! F5 `/ y2 e! d* @ = 3X + 3 ( K^2 + K)
9 j# ^ `% o+ M0 ]5 Y7 [ = 3(X+ K^2 + K) which can be divided by 3
; s* u; H ^9 V) o. u9 ]# j1 }* c; N. N u R5 G
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.( @' ?' U$ A) T
, Y9 M8 k0 s. z( V( H: K1 N[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|