 鲜花( 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)- ^! r% q6 o# B0 P4 ?, S. v# ?
7 Z% p4 q/ @$ q* t" D; V
Proof: + Q, a* F# J1 H8 D- E% a+ A
Let n >1 be an integer
) ?) w5 {. Q* b- c9 W$ k! h) iBasis: (n=2)
, g0 W n6 r; S0 c0 r9 i2 U 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
) b6 a% i- B2 x! _( N
) y* v1 n7 Z" V+ F5 OInduction Hypothesis: Let K >=2 be integers, support that
/ h' n s9 m; K/ [1 u K^3 – K can by divided by 3.
, m) ^/ a3 v b* H+ C/ q" A8 Y/ e& }7 @
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
) [1 Y/ P6 [1 b( r0 Z* l7 @7 V# hsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
3 W) S8 f$ C2 X1 F& I1 U A) tThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
- w, _" k1 \) q7 u$ U = K^3 + 3K^2 + 2K: `: K/ A2 p3 v$ A- T/ @2 U
= ( K^3 – K) + ( 3K^2 + 3K) y5 X. I7 U1 a
= ( K^3 – K) + 3 ( K^2 + K)
, r5 b1 _5 [& p& r1 [. Iby 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' X9 u' m2 g h
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K); I9 f2 F/ L' d U! U$ q L
= 3X + 3 ( K^2 + K)
) p. }1 C R: z/ a B& o = 3(X+ K^2 + K) which can be divided by 3+ U5 n' }9 Q/ h6 ?7 Y
/ X. y6 T! M9 p8 S) ?2 lConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
- H9 e7 Q! a3 y E5 g4 R q% u6 ]% ?# Y: Y9 E! k; [ J
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|