 鲜花( 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)4 G: z& e* |- l! R/ p; A4 t
1 ~0 z& Z# c+ s1 U: b; \
Proof: + V+ y6 Y7 L, t1 c* Y. _( h' |4 J
Let n >1 be an integer
/ R. p u. ^# R0 O# R! j [2 @/ zBasis: (n=2)5 o; k e6 R$ Z: q5 |" B
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
: r U7 C \8 [6 w4 G4 U& z+ }
* r# W1 Y/ E4 A% u. BInduction Hypothesis: Let K >=2 be integers, support that, ^% O/ o. U0 }2 E2 k. V
K^3 – K can by divided by 3.
6 j- S0 t i6 U( x) R6 X% P
* \2 n$ l7 [- r& L/ K$ A$ n! s6 CNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3 d. H$ b6 S+ B& V$ o3 A
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem& T2 Q! Y( k. v+ W
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)# H4 B6 p6 Q- M% w+ s; r6 s
= K^3 + 3K^2 + 2K7 @5 h8 w" I2 J8 w! Q0 Q( s
= ( K^3 – K) + ( 3K^2 + 3K)- L( G; W; K7 M
= ( K^3 – K) + 3 ( K^2 + K)
0 Q# R; i% |4 V- U2 s$ kby 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 o6 ^, Y/ M2 f# G4 I# H3 OSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K): ~. s" r* c; o" n( M1 o
= 3X + 3 ( K^2 + K)
s w. T2 m8 Z) i = 3(X+ K^2 + K) which can be divided by 3
4 S4 G- \" x$ u0 ]7 M+ K6 T1 ~
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
* X3 s+ w1 d/ Y/ _0 u, U2 E% V
# V% Q5 N, }. Z# D) w( _[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|