 鲜花( 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)# p9 N: a0 s$ ]
# ` c; n* |, y% x; YProof: - F8 n! u# S( z4 t8 M4 c
Let n >1 be an integer
7 T* g2 u2 y! G8 A9 pBasis: (n=2)
$ L/ m5 k# Y3 ?! S/ u2 z, q6 V 2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
; @0 k6 E& a5 t: d# o- P7 k( U5 L. v" `2 a2 O2 B4 I9 r" H
Induction Hypothesis: Let K >=2 be integers, support that
$ y+ d% I/ a( `2 O8 b K^3 – K can by divided by 3.
/ [4 d% a7 _0 F' m, h( I* _, i$ ~- p4 X* U) `; u7 y! B
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3# c0 ?7 O* O/ o
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem' i0 n5 {9 R& R: D) b% q5 O
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
" {) s2 g/ e1 f3 \4 ]5 r = K^3 + 3K^2 + 2K
; o, v3 s1 X$ E+ ~; g; G = ( K^3 – K) + ( 3K^2 + 3K)# F X) B1 }5 w$ @& \5 x- O
= ( K^3 – K) + 3 ( K^2 + K)
) `, E1 p, l* z: ?4 K6 R% nby 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- C* E4 L* o! A% @: U
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
" {" b$ {9 y0 C; O: \' \ = 3X + 3 ( K^2 + K)
& \7 d( L3 z8 u2 a = 3(X+ K^2 + K) which can be divided by 3 A- ^ }2 L @4 m
6 K- X+ n' Z9 q3 s) V6 EConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
5 H* {$ ]( h4 A4 ?4 }# A/ X0 p$ o' n% u4 G
[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|