 鲜花( 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)
, S4 M8 S2 g( ^) ^2 W! \# L7 A1 O& c
Proof:
3 L! S4 @1 \/ I$ x1 pLet n >1 be an integer + k5 `1 C% `3 J* T1 X# T) I
Basis: (n=2)3 V9 F0 a" k( D% i, }- e2 S% m
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3( _$ h% f6 ?( k
: y+ O7 r3 z, E* |* F8 W1 v
Induction Hypothesis: Let K >=2 be integers, support that
, x- T" J# G7 M0 a K^3 – K can by divided by 3.
9 G' M. o, n7 V" Y/ u* D9 v! w. X
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3& v% Q+ k3 T. T
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
! u: j3 |# V+ X8 sThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)4 f. ^, t4 h4 N3 A
= K^3 + 3K^2 + 2K' ]: T: N2 Y9 S" q$ ^
= ( K^3 – K) + ( 3K^2 + 3K): R2 E6 K* T4 ?) _% B
= ( K^3 – K) + 3 ( K^2 + K)9 X: j- \" R' f% v; m
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
+ Q* G( @1 }' S8 h ZSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
7 a5 Z) p$ S% T2 n = 3X + 3 ( K^2 + K), F+ X* w" J- _) Z3 |+ I" m
= 3(X+ K^2 + K) which can be divided by 35 a1 p3 u! A& I& r4 _* q
& O/ |( O5 }2 \0 C6 ?! A, EConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
, | U- k! [/ H4 G! o- f7 L; x5 ~; o$ C6 d- q% J7 q# _7 ]( B0 Z% s
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|