 鲜花( 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$ I: Y; N
% C: ?* Q: [- x5 A7 ?5 ?: _9 MProof: 6 K6 I+ [, J5 T
Let n >1 be an integer 2 L7 e3 m/ n" J% }# B
Basis: (n=2)
$ U( j D8 s# ^7 N9 B 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
, ^- T: [0 R5 m, f2 p( b3 H3 w" m C4 |, w2 |
Induction Hypothesis: Let K >=2 be integers, support that4 _! e4 ~; v4 G! W
K^3 – K can by divided by 3.: F8 G* y4 X- i9 V. j
% O4 `4 P( p0 b5 S' x6 {# a" i
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
# u* G& q* e3 Esince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem, H! |$ I; a, w1 }
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
3 }9 U: H e6 j4 K# |% A$ D = K^3 + 3K^2 + 2K- p1 D3 f# s6 A# n
= ( K^3 – K) + ( 3K^2 + 3K)
! p# M' G- ?) e3 j = ( K^3 – K) + 3 ( K^2 + K). g, F* ~1 K3 Q# T
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>02 S. G* n3 c) x1 u
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
; M' g5 U' s3 S2 h9 Q0 D = 3X + 3 ( K^2 + K)3 x* z0 p1 R" r
= 3(X+ K^2 + K) which can be divided by 3
" S J4 P, j8 C6 c9 r8 n- R
, a2 r. c9 U7 L) N+ O U, t. m3 BConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.' l# Z; [, b$ v" ]- Y# J
! i; o9 K9 t6 ~- E( \7 u" ^: x
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|