 鲜花( 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) L+ n* H. }# A% b( ?6 C5 c* k
. v$ s9 Y# R* r. N- N
Proof: ! }6 K* m4 K+ {. D0 J
Let n >1 be an integer
' K; x5 ~, p3 R$ K! g8 {Basis: (n=2)
2 L3 S }& G3 j3 V; ?2 g 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
0 u- {( ^2 L- E" ?: z& n( u: L" E6 i; r1 ?7 s7 T0 o
Induction Hypothesis: Let K >=2 be integers, support that
1 e; @+ V/ I1 M6 h1 ?2 v K^3 – K can by divided by 3.
8 ~" Z0 |) `! g% @+ D' t% M
. y( K2 z8 Z3 }* n+ C6 w5 UNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
2 A, X# B( v' q% B9 v! S( T' wsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem7 I7 @+ T u6 S' u% Q
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
" ] M' c! s0 G% W; H$ V = K^3 + 3K^2 + 2K0 F/ j0 _5 T8 J% z+ U( E# H( t
= ( K^3 – K) + ( 3K^2 + 3K)5 m0 ~+ r) ~- K% ]( N# n+ x$ s" h
= ( K^3 – K) + 3 ( K^2 + K)
P( K3 z& Y; o5 l3 z4 ~3 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
( {, `( Y2 w7 m; J0 YSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)9 E; V4 z! x) u' J+ F
= 3X + 3 ( K^2 + K)
?% @9 C1 @4 C$ T7 i; {8 u = 3(X+ K^2 + K) which can be divided by 3
; \: R# t- [7 _" F. j: Q) _' v: M) _% F8 ~. x! O
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.$ V; v: T }$ v
9 a! P" P- l. w; d; p$ {[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|