 鲜花( 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)& s: p6 ~& Q9 {, P
9 ^3 A+ d4 e0 ?1 B6 u1 b
Proof: * p6 b2 i9 P1 q8 E/ z, J) z( f3 o, P# |
Let n >1 be an integer
/ u: `! ^6 ]5 F! T8 R- `, DBasis: (n=2), F/ B. U+ g$ I* u2 k+ T( C3 @7 M
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3, t. m! I, y$ ]' Z( ]
8 c6 \7 Y7 B5 Q
Induction Hypothesis: Let K >=2 be integers, support that8 |5 ~& d! X. x. u3 Q- K' _
K^3 – K can by divided by 3." b: C7 T1 Q. x* x8 u
3 F+ T: |) q) ~4 l& f5 w0 h1 R
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
( B* B* ?3 x; Fsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
! w; q3 T7 `, v8 ~Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
1 r+ T2 g- B& n5 f, H6 Q6 d/ F* K = K^3 + 3K^2 + 2K' q, u# Y6 {# c& ]
= ( K^3 – K) + ( 3K^2 + 3K)
" n% G! J/ t. g) B" u = ( K^3 – K) + 3 ( K^2 + K)
; |& d, {9 e1 C$ ` eby 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# f. M4 \" F R7 r6 U4 E
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
3 x+ o; S+ a# P* P* C+ x = 3X + 3 ( K^2 + K)
5 P' S, P9 {4 U1 C = 3(X+ K^2 + K) which can be divided by 3/ n" v9 F' y4 a0 F6 L' L
/ {1 p: i$ u$ R8 N3 DConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
$ G- C1 q1 V, ?8 Y/ w( O4 R0 Y2 k
4 o" e% w6 K! N5 I# S[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|