 鲜花( 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)* L ]: s, U4 s# `
% q8 I8 Z9 }2 s+ E4 @5 N
Proof:
* e% j* L& R4 s/ V9 Y; K) f4 o" xLet n >1 be an integer
# n" k0 t2 y+ H; |$ \& O; BBasis: (n=2)
5 P: ]4 R) v2 T8 ?' G 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
: C6 s/ }% s! A3 W" R2 i5 f) T, S6 k3 s! \' v6 u, \9 z p7 u
Induction Hypothesis: Let K >=2 be integers, support that6 ^9 ^' l6 ?/ A9 I: ?: e( o
K^3 – K can by divided by 3.4 Q5 z; e, M7 z- T h
, K1 ]9 O* M- R: JNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
2 i" a+ g n" p/ l" psince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
' `- Q0 f! z6 Y) c' L( OThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1): g& q. T: Y4 ^* y9 [' s3 o
= K^3 + 3K^2 + 2K
9 N* d. v- Z0 @; {* R- T = ( K^3 – K) + ( 3K^2 + 3K)" ?' ^7 z2 ]" Z6 ?4 g! V
= ( K^3 – K) + 3 ( K^2 + K)
( Z+ L3 p- j$ \9 sby 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
1 N8 V. ^( y( k1 L: B7 Y& ISo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)( J3 J' `" }; F$ U; O
= 3X + 3 ( K^2 + K)
5 Y/ @+ Z& } q3 X* ^2 {. d2 Y = 3(X+ K^2 + K) which can be divided by 3
8 N3 J" ~4 h5 ]. X
9 r/ v4 [ g( A& C: j3 @Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
2 y5 Q1 L8 {" v; s) }! }% Z8 q4 k: s$ R4 u
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|