 鲜花( 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)
; M$ r3 t& s3 b7 d+ e0 \
" _! e9 n! F* P$ C# o5 v( I3 g# ?3 p, zProof:
% W9 B6 T5 U4 z; vLet n >1 be an integer & E* G0 t& `! J3 U
Basis: (n=2)
3 L* `& e! X3 G 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
) I- A) X& ]( {7 }: w. j( Z; x- y* \( d5 y/ @& l' U" w
Induction Hypothesis: Let K >=2 be integers, support that; f7 s% O. _6 X5 \/ Y
K^3 – K can by divided by 3.0 b3 {5 r Q% a- T
! p$ w' h' P2 }6 W7 `
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 37 y7 v P8 r, t: n K4 x
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem" T0 T+ ?) d- F: r( W* g1 M$ x
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
/ q+ D3 b. ^- ~/ u* A' y" ] = K^3 + 3K^2 + 2K( d& G }- P% C }' C* u( Q/ c
= ( K^3 – K) + ( 3K^2 + 3K)
6 f+ h2 i9 [. O! r+ G+ o! a = ( K^3 – K) + 3 ( K^2 + K)
, B, l5 p6 R0 N* q% z; 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
. O* p3 @! A4 F' W" c; ISo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)% Z' R) B* Z# `% s
= 3X + 3 ( K^2 + K)! b k' p- s4 l7 @- C+ A0 O& x
= 3(X+ K^2 + K) which can be divided by 3
2 d. i6 i# K+ }) }8 o0 d. h7 W. h4 W' m r* k( X5 y
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
9 Y0 W% a ^$ Y+ q& n1 j7 Z) @/ S6 w8 k- g8 ]) Q9 [1 E. o
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|