 鲜花( 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)! v8 l" Q8 C* N0 e8 x
4 E. T! e2 Q1 P9 LProof:
3 s0 t6 S( v' E4 g+ HLet n >1 be an integer
4 K& F* K$ g) \, K$ ]0 [1 Q) \) bBasis: (n=2)
+ f/ @5 D/ ?. w 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
( x; L( U" ^2 ]8 |% l* v
3 B P, c, _9 k* l# wInduction Hypothesis: Let K >=2 be integers, support that
5 l; {$ `4 E) Y) u7 b$ ?- K K^3 – K can by divided by 3." A4 q, V8 K6 k: T% @0 J: W8 y
1 ^% I* t: W N9 M6 V u* `: G4 t4 q% MNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3& v5 f" X, Y$ L- j5 I
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
" V( @7 w2 L* ]) r/ J5 HThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
5 q, v: e; z/ h$ w! j( \1 v, ~ = K^3 + 3K^2 + 2K; G0 Q. V) C, P5 o; b
= ( K^3 – K) + ( 3K^2 + 3K)
0 J5 x% g) X( `; O = ( K^3 – K) + 3 ( K^2 + K)
1 `' \/ S( R# D* K# C8 N Dby 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
9 p+ T3 g# w% o* w& ~! t# h( A5 HSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
1 U1 d- r0 [% i* V, y = 3X + 3 ( K^2 + K)
+ `& p( P$ M/ [# s/ e% a3 l/ i = 3(X+ K^2 + K) which can be divided by 3
1 M7 ^1 W: T( t% c
+ C5 X% v% j/ U6 `9 VConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
t0 U! K' |$ Q( L4 e& u# ^
* J* } @2 `5 F( }2 n. o; C, e$ [[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|