 鲜花( 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)% A8 X, s$ ~1 P" `/ Y+ d: y, F& ^
3 p1 w8 A# @- a8 C" v, q- R
Proof: $ ~6 [1 [) x( I% z q$ Y
Let n >1 be an integer ; `9 Z- i( e8 C# r) v
Basis: (n=2)% f( w* h1 D6 y7 g' y
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
. N( K/ R7 a1 R# ~7 u
/ ]5 e; x' N6 h% G/ ~1 E9 ?( PInduction Hypothesis: Let K >=2 be integers, support that
5 f: j, L, W! r* F6 |& O8 ~ a K^3 – K can by divided by 3.) y9 k, \7 C7 \! Y1 p( p' L2 D3 s
6 O$ k9 ^8 C G& M2 bNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
' ]6 D' m& T8 q. s8 b }8 i; [+ fsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
" l6 }1 a9 C kThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
. }6 K9 ~4 P6 h' v& l* K = K^3 + 3K^2 + 2K" Z' B; D$ n7 X1 T
= ( K^3 – K) + ( 3K^2 + 3K)
9 k @! k1 D8 `' `! S& J6 K = ( K^3 – K) + 3 ( K^2 + K)( e, s& t6 t4 Q2 A$ k' [, T
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
8 ]; [( _' p4 [7 \7 g+ o. aSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)7 k( v! A, z' ~- _3 [/ e G( H' Y! ^1 [
= 3X + 3 ( K^2 + K)/ w8 [# |* P9 {. Z* E* M8 M6 l
= 3(X+ K^2 + K) which can be divided by 3! [, F( `$ L& @" N) t2 r
! ~- m3 C8 w5 b# S' d5 PConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
3 m$ V# x/ S/ k/ I) _
/ s8 N/ [3 Y2 i' T/ y y7 b0 E[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|