 鲜花( 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)7 y8 ]: Y5 u1 ^# v
# x/ r& E1 M( \' o2 s. v% w7 g+ fProof:
1 N! c' s' N# A" F' Z; i- zLet n >1 be an integer % U9 n. P4 l1 M( o% a+ ?5 Y3 L
Basis: (n=2)
6 u* U0 `2 r, X& D 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
# @' O+ O; T3 t( [# M& s4 A" `4 }6 a, Q2 u9 h" T% \3 z: [6 l3 p8 r
Induction Hypothesis: Let K >=2 be integers, support that& C% A" d" N/ Q. s$ m/ ~! k
K^3 – K can by divided by 3.
; c, |) X$ [- j4 ]( X7 m" G8 I- a4 G1 }
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
) {7 M4 z* F" ]9 f9 U! Q9 @since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem: m8 a5 |7 c" N0 O, L
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
1 g# f; _) x" D0 \ = K^3 + 3K^2 + 2K% V: K. A2 U) ?8 t
= ( K^3 – K) + ( 3K^2 + 3K). f" m5 q: k4 r) K/ |
= ( K^3 – K) + 3 ( K^2 + K)
/ z) Z. _5 o; K& Vby 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
5 P) |9 N& k+ z z/ H& l& CSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)1 Q% C4 P1 J/ k+ t- n
= 3X + 3 ( K^2 + K)
. ]' B5 _% X/ _; A = 3(X+ K^2 + K) which can be divided by 3
+ A2 Q# v1 Z! A" M3 ~( \0 d" c U# W8 H0 j$ g* S, Q
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.5 n6 Y; }; k7 E* d1 w/ E
0 u, k1 P- ^: }9 e9 n" f" V( e
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|