 鲜花( 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): [( s9 m/ i7 F: k
5 T+ `, h& n: J t1 r
Proof:
6 n6 ^0 `7 L* j# p* iLet n >1 be an integer % @7 v& s8 C$ B+ X$ p& `* O5 D
Basis: (n=2)
% g" w% Z0 v1 { 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3; ^# Q! ?% o* |1 M# ~$ h& C3 V# J* ~7 F
) l7 l- }( n% HInduction Hypothesis: Let K >=2 be integers, support that
$ x( t% d! N* W; r: ~4 d K^3 – K can by divided by 3.& e) t+ W' ^3 ?4 V6 B: M" ~1 C
$ i/ P$ i, r- v( h2 Y7 ~; PNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
% v( m7 e- a) a3 Nsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
; i/ Y* M* T0 O5 z0 kThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
$ [0 D' U; ^: M. o8 a9 T = K^3 + 3K^2 + 2K
. h x4 {; ~3 S% H# n = ( K^3 – K) + ( 3K^2 + 3K)
1 r2 v" Z+ p' m- D) m- Q% M = ( K^3 – K) + 3 ( K^2 + K)
7 m8 Y. }% y3 K" ~& W2 }3 D+ N% qby 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; T* D+ T" B1 e8 o9 @
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
5 _$ i' u" |+ X6 a5 b = 3X + 3 ( K^2 + K)
7 Z: h7 D8 W P3 a8 X = 3(X+ K^2 + K) which can be divided by 3
9 j' I# L3 y I
8 }8 V' }% O0 H4 [% jConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
" J8 K% i% }4 k
' L) Z+ k; `. r' l" X$ Y* E7 C2 j; B[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|