 鲜花( 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)
: k! A7 m7 K$ I/ D! K0 G, ^ B$ E" H k: P3 o) E
Proof: 8 ]3 F! B6 H6 U) K7 U2 E1 V3 C( M9 Q
Let n >1 be an integer ) p+ Y4 P4 N5 W4 r0 p
Basis: (n=2)
* O& b3 z8 {& I 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3% S7 b% h! q& g9 O
: q8 U5 U" K ?" Q" r# H- Z5 P; U0 e4 L+ QInduction Hypothesis: Let K >=2 be integers, support that
7 F7 G8 ^3 l, A' y% P$ {- R& R4 o1 A K^3 – K can by divided by 3.- i. D3 l* ~0 r
/ W/ k8 i2 q0 \. T6 [Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3 V, ^: w9 `# _3 E5 h
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
$ }& B- L( |; t# ?Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)6 m2 N. _9 {+ u( ]4 f1 d, O
= K^3 + 3K^2 + 2K! L, Y/ {: G2 n6 Z1 J7 X
= ( K^3 – K) + ( 3K^2 + 3K)( O( u, [! i# ^" u
= ( K^3 – K) + 3 ( K^2 + K) o: s# B) U0 M$ X2 h: @% ]* K4 N( t9 C
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
3 x! Z7 O* T3 iSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
' q ?! U F# p4 i& {$ q n" d = 3X + 3 ( K^2 + K)
4 R; V$ J! a9 n O* L = 3(X+ K^2 + K) which can be divided by 3
3 N4 ^9 Y4 q* M1 N6 ~) j$ t7 d& h$ t' N/ z8 L. ]: e
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
! u$ E( A$ d: c5 ]1 y
2 E4 M+ x* H1 n3 {- r' l[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|