 鲜花( 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)
. ]/ r! y1 y' h- ?1 F* D) C
1 S( R, {4 M. W/ xProof:
2 Q v: {" j6 o$ ^6 H) Y6 t- R1 FLet n >1 be an integer % L- m( u, ^% @& u; i" x8 k+ `
Basis: (n=2)
- x1 u8 M! g2 Q 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
5 W. @+ u' N$ e. T
2 x/ ?/ h. W( PInduction Hypothesis: Let K >=2 be integers, support that
/ {, F/ {$ e, I! C, ]) Z K^3 – K can by divided by 3.
" o2 X0 o2 _" \5 \% T- }5 c! G n8 d9 U! t2 Q1 Q
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3& O( M/ p: i% T) z, f! q# I. ^% p
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
2 Y" d+ }$ B& C- S! @* d3 T, sThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)8 g, \8 w( V8 A2 ^" _8 H
= K^3 + 3K^2 + 2K; _8 w# p; U; X4 O
= ( K^3 – K) + ( 3K^2 + 3K)2 f* [3 _. w* I- m4 z3 R
= ( K^3 – K) + 3 ( K^2 + K)
" C/ y& G% ?. M" L8 R7 g! Jby 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+ L( r4 U1 L" m. U7 m D* u& x! v
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
4 I* o! F9 l# {5 W1 g5 z = 3X + 3 ( K^2 + K)- k+ e0 Z# G4 X/ U& Y+ Z
= 3(X+ K^2 + K) which can be divided by 3
: h7 |9 ]& `3 F3 U- o3 r! W5 R( A
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
( W4 U) i9 p/ O9 [) D, r5 F+ O+ i8 r
* E$ {$ z# C! {9 _. O[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|