 鲜花( 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)
- @9 e, Y, `! F C+ c0 L7 b
( g% q4 H6 }9 q5 \& iProof: : K& g' Q1 Z8 w7 A/ j
Let n >1 be an integer
1 r. q8 J' Y2 h- t+ M& m7 j- IBasis: (n=2)9 A2 U, }# _" C/ M2 j: ]: A
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3 Z' |! t( n. v8 \0 V
: l! Z$ P# Q& T- U# n* w; K! r6 Y9 OInduction Hypothesis: Let K >=2 be integers, support that
7 j: w9 z$ g, X ]* z K^3 – K can by divided by 3.
( J7 a7 C0 m @! E8 O) ^' E4 t# m8 _* ~
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3* n T; B: R" `& R6 e7 D3 a6 Y
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
3 {% Y1 V! O" c7 s* E/ r& MThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
7 J' o/ d# a* W3 S7 D+ g = K^3 + 3K^2 + 2K8 x% |' x# X7 ]$ e5 Z: U
= ( K^3 – K) + ( 3K^2 + 3K)
* ~1 O) F2 I- q = ( K^3 – K) + 3 ( K^2 + K)
, n! V% S9 N5 X* o$ K( sby 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& y/ \( T" T: Z! h9 l
So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)* s0 d) u& O7 b" S, {& k
= 3X + 3 ( K^2 + K)* R5 a: t9 S2 _* J
= 3(X+ K^2 + K) which can be divided by 3$ }* x" s6 H w2 c: P! ^# ?
8 z, }5 i5 ~( n0 sConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.; {7 W% l- U7 F. `0 I# B: \' ]
! Y/ S+ i9 ?, A" e" m[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|