 鲜花( 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); `7 l8 `5 ^8 }& m' y% ~/ H
, \6 q" Y# G9 d" a, _+ L, tProof: ' o6 X, {7 z3 z U3 X: n; `
Let n >1 be an integer 5 ]- f) G! { a2 ], L+ g
Basis: (n=2)$ y) x4 ?; o( i0 |' \
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
! T2 A" V A& R* }1 O( T' V" m+ u7 G2 |) |, G
Induction Hypothesis: Let K >=2 be integers, support that1 Q) q+ x7 ^% w8 j* d
K^3 – K can by divided by 3., Y1 n- O- h! t8 `& C
' l3 ?- \) _. t* h9 t. d! M- P& \Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 33 k' O% |$ ?9 w5 N! Y% B
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem/ D0 p" m) \/ |* {. H& G$ \4 O$ k
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
/ D) s8 H$ @: x = K^3 + 3K^2 + 2K
6 n" H8 r8 u' C7 L' [+ J = ( K^3 – K) + ( 3K^2 + 3K)
) @ P8 y0 l" m1 c/ N = ( K^3 – K) + 3 ( K^2 + K)
1 r9 k! N1 W9 I6 {6 b, Lby 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
; C9 f7 p' O2 y$ ASo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
" y7 X' I# U0 ~1 j7 Q' \: _ = 3X + 3 ( K^2 + K)5 Q i8 t% \1 t3 m: F
= 3(X+ K^2 + K) which can be divided by 3
2 H2 y* f1 U% B5 h+ a9 ~+ x2 A- t$ E
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
4 \ a( O; k7 @3 V. r1 ~5 [2 v5 P; W k. }- e8 L* C6 o
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|