 鲜花( 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)& W! n* L# ? j+ S. }8 @
' z V- m* j4 }) q5 F8 Q* W3 B. S
Proof:
# `6 t9 Q0 Y( O H% T6 qLet n >1 be an integer
, o1 Z3 m' B' KBasis: (n=2)4 a! ]2 I5 d" u4 y9 }: d. K
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3, @ @8 l7 l) f2 x5 _$ K
7 m' n& o2 D( c% V/ q! l/ LInduction Hypothesis: Let K >=2 be integers, support that
7 i. X$ Q# T3 B) V. E8 a4 x: U6 U K^3 – K can by divided by 3.
* N0 m3 y: D- j2 b5 ?; E8 l E$ a) A/ B( W u4 d! {& X
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
1 l1 _, h. U0 Z) ~; L2 w/ ~, [since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
4 ]( y; L' N& A' L" e& M' aThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
1 p4 c j" A& ?: Z2 | r = K^3 + 3K^2 + 2K
7 b3 C( |6 `& v U5 T8 f b = ( K^3 – K) + ( 3K^2 + 3K)8 X7 W5 s6 X# P8 y$ o, L
= ( K^3 – K) + 3 ( K^2 + K)
6 X0 R% z# @- D8 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
. C! c- l; z7 W+ W* SSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K) e: b- f9 }& ?" Y
= 3X + 3 ( K^2 + K)
: g* Y5 p3 }6 X' c- j' c7 f$ L% Q = 3(X+ K^2 + K) which can be divided by 34 t7 V* B8 w( }+ G# p* H( M7 ~2 T* a
# q0 v0 K3 g* A0 Y, N" a+ x) J7 c
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.# g$ n% C, y5 C8 c) S0 `
2 a4 N' s9 w' E/ U
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|