 鲜花( 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). g* I4 [: ]% |9 t* {5 z0 B' E d; |% Y: V
/ q2 t+ Q8 {6 Y/ p7 V5 wProof: ' y4 @3 I2 O/ ~# t4 u
Let n >1 be an integer . o; i+ E3 D) t8 u- r6 R
Basis: (n=2)
/ c! T0 L9 @+ c# ^+ e \, d5 H5 Y 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 33 W5 X* L' O; {: @2 M, k6 }3 {: J$ r
* y. e; w5 m) U4 KInduction Hypothesis: Let K >=2 be integers, support that
7 y, W. I6 I% l( S: j+ z5 W K^3 – K can by divided by 3.
( S! \# ]! G N0 o2 C( o2 I& A+ d* b* | ?( T
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 30 X' Y2 ?; k& s6 |
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem( G1 I5 I: H: j/ y. V" C3 W* Q3 F
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
8 F& l: M# e0 E0 P; M# m, l, r* e = K^3 + 3K^2 + 2K
! z: \+ I+ M) a& Q% q = ( K^3 – K) + ( 3K^2 + 3K)
5 s6 M7 m# N- r = ( K^3 – K) + 3 ( K^2 + K)
: x4 q: @9 y; qby 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; ^& `0 f h/ ~. K
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)- n2 d3 h# `* A& q
= 3X + 3 ( K^2 + K) O4 Q0 X! c6 i0 \( i* M
= 3(X+ K^2 + K) which can be divided by 3( { A l/ u' j. U
& L& a. ^. f! z1 |4 g
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.# u# R# V2 |: O3 |: O+ m! l1 K
. B8 w$ G% C& Q[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|