 鲜花( 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)% i8 I4 N; w E" }9 t
9 W' O( u& K, ]) [1 |; f* s2 U2 f
Proof: 9 _+ L+ z1 |* j8 C
Let n >1 be an integer
( P+ h5 k' K0 b( M1 {4 gBasis: (n=2)( ^4 t3 l5 ~1 l, P+ |; y
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3! G* _1 K2 y% L. d/ N- ^% S; ]
- o2 G5 q' y6 B$ X
Induction Hypothesis: Let K >=2 be integers, support that3 ~; M8 n5 U# c' J6 W8 `: p
K^3 – K can by divided by 3.
4 r) F p% d! L5 F' Q9 r
& w2 s- S7 `( v/ [* Z D7 k+ ]) sNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
9 t1 `; h) f! | Tsince we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
" Y, ]* \+ k' N: ]# }- y6 M/ {2 ?% x( LThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)( q/ }" \- y8 `* y
= K^3 + 3K^2 + 2K
# d6 \3 `4 E1 F' T8 ] = ( K^3 – K) + ( 3K^2 + 3K)
8 r5 G0 g1 R2 z m! u) {) c, i" U = ( K^3 – K) + 3 ( K^2 + K)
/ D6 O3 A) K( Y$ K# qby 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
/ [' \# S( i) v' k1 jSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)
' w3 N! m! D" Q; ^! n: z/ T, Z = 3X + 3 ( K^2 + K)2 v5 I- T5 u1 p6 D5 ^
= 3(X+ K^2 + K) which can be divided by 3
/ U4 R' X9 R7 x0 v
, f- @5 M0 ^+ ~" B N3 Q- NConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.0 ?( F! t% o! p3 E) n% g+ t
- N, s& _4 `1 M6 S6 N5 j" B[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|