 鲜花( 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)
" L7 O. o! \* V; {1 v5 Z6 U( _9 a q. R: A) ^4 R8 F; N
Proof:
8 ~/ c s! x9 M0 [; \$ Q4 F# _Let n >1 be an integer
$ D; O. |1 p) W( p6 J: F/ ]1 `2 cBasis: (n=2)' L! ^+ {! o+ u2 a9 j, S2 B
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
; Z# v! Z2 J7 q
: D! C1 U9 C* u' Y( r7 ]2 wInduction Hypothesis: Let K >=2 be integers, support that
# r; [( X r0 ?8 _. x6 R3 T) D K^3 – K can by divided by 3.
6 @% Y, t" y3 P
3 N. ^* e& h' E( j g* QNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
2 J8 |/ G' P5 ?. R! Dsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
& ~( l$ k4 _- ~3 ^* o6 vThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
3 w( D7 f6 k& D- j3 ]. [+ B = K^3 + 3K^2 + 2K
& C5 M% u' I* m \* m = ( K^3 – K) + ( 3K^2 + 3K)9 M( f: {5 W& n
= ( K^3 – K) + 3 ( K^2 + K)
! [% J+ D; Z3 v; J" U- ?1 i7 d; Aby 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
5 {1 w$ m1 N9 E5 h; Q ^# qSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K): ^5 F% b4 r: `4 c
= 3X + 3 ( K^2 + K)9 K6 C7 O, B4 c* B# O
= 3(X+ K^2 + K) which can be divided by 31 @( Z1 V) u( B. Y( l& e9 G
* k& B1 _ Q; r+ m7 b( b3 ?Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.- L c% Q* c3 W% P6 P8 l
& P$ l, |! l3 w* O& D2 G[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|