 鲜花( 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)
3 W; p, p$ y5 u4 h( k5 ~* ?9 Q7 f- k5 s1 e7 F1 ?- T
Proof:
% i/ ?9 i9 G8 B: z/ iLet n >1 be an integer ! a% \2 T7 ^, X
Basis: (n=2)
! Y6 O) O: J4 Y0 V" j% W! k; i% r; G 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
+ M# N! K4 K M- O+ \2 {5 m
: q1 f* ^ g: u! xInduction Hypothesis: Let K >=2 be integers, support that
' J9 h( ]7 D" j" t' W K^3 – K can by divided by 3.7 l/ v8 I# I9 d" N) y
/ t3 X8 p% \1 h+ Y4 _5 C- qNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3; d8 f) i+ q1 ^& b. \) Q0 Q
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem: t/ s/ W" u1 ]8 I0 J6 d
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1), x& H; A6 b2 Y4 q1 h# \
= K^3 + 3K^2 + 2K
: [) T$ Z# C2 H0 |: q6 j. F, j! E6 K0 O = ( K^3 – K) + ( 3K^2 + 3K)* m% D. Z2 N4 m0 @5 z( U
= ( K^3 – K) + 3 ( K^2 + K)' ]6 _+ e0 K* u; F 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
6 U$ @( W/ y; u( V9 QSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)" I6 J" w+ Z' O- O" t, G6 o W2 D' \
= 3X + 3 ( K^2 + K)' `1 N' d5 b/ o! }3 R4 S3 Z: X& j; I4 L
= 3(X+ K^2 + K) which can be divided by 3
" K& t/ I1 Y! @! D' o0 n6 _* l5 j. w; n+ I9 M
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.' @9 r0 N6 M- ~- z1 d
" ~3 [' K V0 i6 k! J7 B" i
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|