 鲜花( 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)
# t$ O, k( B, k. l! J; ~6 m+ N m4 C1 P! _" \
Proof: 2 B, s8 `' I6 V6 w- t0 b
Let n >1 be an integer
8 M' C5 j: w& F# dBasis: (n=2)
* w6 i& D, f9 u: k- w/ ^# S$ P- t 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
9 e6 a7 w6 ?# G2 V r5 M
- \4 t( l/ U6 q" QInduction Hypothesis: Let K >=2 be integers, support that# A. u' d3 r$ d* n" a5 \& e) ^
K^3 – K can by divided by 3.: f$ D; o" Z& q/ ?, f: b
4 t' b" G+ n7 J3 k4 N# s# x- F* bNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3' o4 m' Z7 b) D
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem9 A7 @6 u! _3 W& J# q1 o9 c
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)) L s8 Z0 z& x; T* U+ K
= K^3 + 3K^2 + 2K- [; {& N) z2 F- ^7 [$ t( P( z
= ( K^3 – K) + ( 3K^2 + 3K)
- S8 Q9 u, V' h! z = ( K^3 – K) + 3 ( K^2 + K)% L- d* o {+ f! F" c8 e4 x" F
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
# [7 j" b4 `9 j0 m8 pSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K), w/ ^% q/ l; T- Q; d
= 3X + 3 ( K^2 + K)7 b2 ?- e- L& ?1 K
= 3(X+ K^2 + K) which can be divided by 3
$ t" {% ]4 n; J- Q' k: {/ ]# Y# q3 y& v/ C9 n8 w$ d: e3 D8 C
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
+ m6 A2 d [ @* x! U1 q% [) a/ E R. T+ ?) n
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|