 鲜花( 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)
0 y4 v; d) G- E! ?5 Y" g1 D; H0 U$ E/ m1 F9 A
Proof: ) j: m; |$ N, x! k7 ]. P
Let n >1 be an integer : ]9 {( }% d8 T: x3 L) ]
Basis: (n=2)( I4 o; E% h0 y5 G& W
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 39 I) i# F" z$ T u8 J& {# @5 n* f
~+ C% _$ y6 r* C% h) S
Induction Hypothesis: Let K >=2 be integers, support that
' G( ]7 R7 I" k( [& c K^3 – K can by divided by 3., _2 r J# P4 ^- ^" k: V+ g% a. [1 ?
& k, f1 K3 Z& a+ k3 d' [
Now, we need to show that ( K+1)^3 - ( K+1) can be divided by 3
: _; o4 w) B5 r, x6 A+ o+ b3 p% O; \since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem
7 ]9 R C1 k9 v- ]# U0 w$ P2 PThen we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)
- T3 Y s: g/ z+ [& ~5 a R9 L = K^3 + 3K^2 + 2K
8 d: Y1 J& ^% R$ T% s% K = ( K^3 – K) + ( 3K^2 + 3K)
4 V) p) T; O/ G! p1 s = ( K^3 – K) + 3 ( K^2 + K)" m" j6 X& M: _/ T- T4 Q) q
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>0
- k8 R0 C; E' ]" P' y% d: i4 g. a5 ^So we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K)6 Q, w- U6 G7 H2 y
= 3X + 3 ( K^2 + K)
7 g. _% v* P% p2 _2 L. @ = 3(X+ K^2 + K) which can be divided by 3: r& C- A- Q4 X) r3 K( @
- H1 i j1 e2 u6 k- O) k uConclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.( j* c$ u7 x0 G! C
! E* {2 y/ D0 D" W. ?% T1 x+ m[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|