 鲜花( 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)
, e( [1 h8 N5 p6 ?9 n3 D; k- j! u M, }7 z6 T: ~% e
Proof:
( D2 g% B% \! ?: r" V8 { i5 }Let n >1 be an integer
6 H* y8 u0 l- R, y( B: |Basis: (n=2)- [$ u/ z- I5 C; [
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3' `7 C+ _% {7 H! I7 ~
* D. w5 R2 | R4 X: ^8 w
Induction Hypothesis: Let K >=2 be integers, support that
; \5 s" T8 p- F; w K^3 – K can by divided by 3.
3 C# K' z9 O0 \) e
& r) c6 o' ^2 l! {Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
) y# s3 r. D! D: d7 H& l# \6 Csince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem- [( b" H- n$ T6 w; d( B4 i: }
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
( j2 Y _" c1 g = K^3 + 3K^2 + 2K
4 t, r6 a) I- S' G3 i' z6 o = ( K^3 – K) + ( 3K^2 + 3K)1 {- c0 k* C3 G7 M. F5 d: x
= ( K^3 – K) + 3 ( K^2 + K)% V( f6 ^( K, N8 ?+ }1 ^* }/ Y
by 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( a! o& \& ^8 @9 K8 a% J, D
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)& F$ X9 `% b# T4 K! W
= 3X + 3 ( K^2 + K)
`$ w. } w, k = 3(X+ K^2 + K) which can be divided by 3 w) B* d. N6 ~( O) ^/ w/ }+ Z& w% }6 b
! e* _$ s( k: C% j; Q* }Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
8 Y6 z# i+ }3 J# j* |7 C
% G9 ]! k, E5 j/ w u[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|