 鲜花( 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)
. e: N( \7 c0 A% N9 E/ _7 Q
* H: F7 [# ?4 _$ K sProof:
( b/ }. h8 K! S$ ^Let n >1 be an integer
) A' f- ^: U; M) @; gBasis: (n=2)
/ l5 G8 f: a6 Z9 O. w 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
1 Q3 L6 t) w1 A, O5 C- W' M8 O i5 W8 u/ d9 Y
Induction Hypothesis: Let K >=2 be integers, support that% q9 v7 _# w6 Z* w! [4 v$ \8 q' }# K
K^3 – K can by divided by 3.$ J; R( g- M; ~) i5 r& O
0 f% T; f8 M2 g, a! h
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3& P) ~% s6 P$ r+ [, z3 Y
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
- W) p: E5 Y. n( U/ F( m XThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
7 t% k2 K2 A9 T) p0 G = K^3 + 3K^2 + 2K, T6 M( T( v5 Y: C: Z- Y2 U$ U
= ( K^3 – K) + ( 3K^2 + 3K)
) \" G. r: Z4 G1 s = ( K^3 – K) + 3 ( K^2 + K)2 J: q* L; J, m2 r( i& r, I+ 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* n/ ~: |, n$ J# s4 q! e) \. j: Q
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)( l9 H8 L/ n D
= 3X + 3 ( K^2 + K)
9 M2 v2 h. a/ U/ {4 f, x = 3(X+ K^2 + K) which can be divided by 3
4 g+ |0 Q6 V ^3 S; W
) z7 M/ E7 w2 \* z9 yConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.% ]7 w3 V% @9 y
* O$ |4 H3 E: f2 F8 B
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|