 鲜花( 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)
3 O: h# E$ d, L+ D" v/ J( E& V. v! |+ S6 p. c/ C( R& @; ~
Proof: 6 ~5 m; v, M6 P/ ]
Let n >1 be an integer 7 U& r% N) x" Z: w' V
Basis: (n=2)3 V0 U3 n a+ t/ Z) Z4 |# K
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3; Z) r1 ^6 _" A
! D5 C/ P9 ~. U2 F3 C* ]5 ?4 H
Induction Hypothesis: Let K >=2 be integers, support that3 T. W- i9 V* F4 F
K^3 – K can by divided by 3.
1 K& ^4 m9 h$ m9 E; }2 s. Q7 [' @0 \3 @* x) n: E# g
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3& b/ M* F' L2 |$ E* R% r
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem' |9 H$ E1 U: y" U* f1 N/ |/ q3 [
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
/ A3 `# m2 X# q, z0 H% W = K^3 + 3K^2 + 2K7 ~% @6 o/ h ], ]9 y% L% Z& P% @' v
= ( K^3 – K) + ( 3K^2 + 3K)+ H- D9 v1 `, A7 |$ W' B. ?
= ( K^3 – K) + 3 ( K^2 + K)
" f, u( G, `4 L1 X/ s4 J) Cby 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
R2 @# {! g( H6 ^4 |So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
5 w) h7 F* o9 j = 3X + 3 ( K^2 + K)
; } q4 @: O! U, C% k+ p = 3(X+ K^2 + K) which can be divided by 32 I6 r/ s5 l$ Y
1 l1 y$ g/ ]0 b2 n& Z5 S$ V: H
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.) K1 X L2 Z. p }
) A7 C$ ~. s& s0 f3 v: }[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|