 鲜花( 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)
; q O5 d+ `, r
4 g2 I" \4 S6 P0 U( @Proof: 5 K6 Q, l4 ?5 f4 S6 _
Let n >1 be an integer - E4 V3 k) L; U1 D1 K
Basis: (n=2)
$ x8 F( N/ ?6 L% I0 D. D9 t8 Y% s 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
7 M+ E: a, |4 e8 q' U N3 [- ?7 t7 W1 u+ j
Induction Hypothesis: Let K >=2 be integers, support that* j3 D2 i$ r6 E, c% e- M2 u& I
K^3 – K can by divided by 3.5 }- z) `8 S+ d! X% e1 M7 c
! r# |) J% N d& |Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3 \/ j- J0 s$ z/ A) h3 R
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem; s6 W. @4 l4 M# @& e6 m# e: O3 ?+ z
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1); \) W/ q" c8 Q# h5 F
= K^3 + 3K^2 + 2K
$ _4 W5 \6 f/ F' z N. D. f- { = ( K^3 – K) + ( 3K^2 + 3K)
) F0 A9 c5 l y7 X1 b1 _5 Y) K = ( K^3 – K) + 3 ( K^2 + K)
0 }7 d) J" w) N4 B6 U; o% V3 Vby 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
9 I* c1 }0 N4 F9 b4 z- i% _So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
6 p* y3 j( b2 m3 D4 | = 3X + 3 ( K^2 + K)* N: S# Z9 F9 C s0 m! ]9 L
= 3(X+ K^2 + K) which can be divided by 3
( i+ y& {. O$ l5 G
5 {9 z- S' @, r" b. O# Z7 L3 qConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
& D5 ?% u; D# T$ e0 W
! D8 j* e" i% r[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|