 鲜花( 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)
: x* s6 u! m/ \$ m: H6 s7 n
# H' N# j {8 m+ p' k% o8 S fProof:
; {4 S l8 u/ R: a$ Y, wLet n >1 be an integer
$ \- l* r8 v% }! A6 ^% P& ~% q3 mBasis: (n=2)
, E5 \+ c1 A9 P, C. d! i" T* w 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
) S, A. D" s( [0 A3 v7 Z" B# y6 |) n* r z0 z f% G1 E
Induction Hypothesis: Let K >=2 be integers, support that
, V2 A7 }! g. C$ N# F3 u K^3 – K can by divided by 3.
3 c5 L# F& u6 P. h% Y# H1 [, Q, `- W" G' R, j, U0 y8 K% U
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3; X+ B. \; l! ~& B/ h
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
- j0 T; a; J1 D$ V& vThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1): b% J& ^5 g6 Q
= K^3 + 3K^2 + 2K
" ?, f, X. z+ [6 W; y! W = ( K^3 – K) + ( 3K^2 + 3K)+ n( w0 I v# A
= ( K^3 – K) + 3 ( K^2 + K)
# h- \ n, i9 l+ 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- n5 ^; |) K: J7 U
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
/ i5 z2 e4 N$ h1 W o = 3X + 3 ( K^2 + K)$ l& }+ @( T+ D" u0 A4 W" m9 l
= 3(X+ K^2 + K) which can be divided by 39 n1 A$ U3 V/ o
0 b4 |; H% ] oConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
, w& M- U% [" w$ C* W# D7 [
2 D) Z B( k3 `3 x3 e' W; r[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|