 鲜花( 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)
# ]% R, a2 B+ }6 S( }; _$ M6 a& Q" L( A f& b8 f
Proof:
$ a8 v; _3 @5 A, J+ l- FLet n >1 be an integer ' N" s2 Z3 F, t
Basis: (n=2)0 v3 H% V3 [3 B( z: ]7 l
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
" ^* U7 U: H7 W. W6 {8 C/ A, G4 x8 w# W) L1 I- r' \5 e' x
Induction Hypothesis: Let K >=2 be integers, support that
7 _4 P( x3 U/ @+ Y K^3 – K can by divided by 3.
$ g( U6 U: T1 R; j! b1 j3 ]9 k" W
/ U3 ?' P7 a- z$ d. c3 c8 j8 P4 [8 ]Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3( n4 R$ _/ T# W g
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
: D2 H2 d) O6 j4 e* e- sThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)! t+ I6 U; J& x3 B4 ^, _- I2 c
= K^3 + 3K^2 + 2K! o* L" T1 T' p d* f2 @$ Q+ f" c
= ( K^3 – K) + ( 3K^2 + 3K)
0 I) D: o- Y9 F; z = ( K^3 – K) + 3 ( K^2 + K)! ?/ U+ A# Q O( u
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
& w5 L5 O$ _5 I! T- K+ c- S% xSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
5 J. ^0 \! o- s4 \2 @1 J% _. R# M = 3X + 3 ( K^2 + K)
2 V* t; {7 y: @/ i) Q = 3(X+ K^2 + K) which can be divided by 3
' |% e6 v$ x, }( V2 m: q
: A- t' T5 E# y# `; |" j' sConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.1 D8 q, j9 B. b- V9 ^
) |+ [4 e4 d8 C% N+ E+ k! @) s[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|