 鲜花( 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)% d& G2 z+ Y; d% t( K
; N% d! O/ {1 r( K
Proof: $ P' h9 F1 i2 Z
Let n >1 be an integer ! m; u, s4 ~4 D7 K- C7 j
Basis: (n=2) F' K1 ~/ g# y7 ?2 l r# Z
2^3 - 2 = 2*2*2 –2 = 6 which can be divided by 3
4 X# `5 t$ z8 y# q9 Q i: m. ?1 L- d0 o+ M' o% w1 u
Induction Hypothesis: Let K >=2 be integers, support that! W/ S, U; i f7 T2 W' _* k3 g
K^3 – K can by divided by 3.0 e! F! f1 r& _& S4 a/ }# A; e# Z
2 U% j6 F/ [1 g4 @+ sNow, we need to show that ( K+1)^3 - ( K+1) can be divided by 33 E: u* q4 z% ^! s
since we have (K+1)^3 = K^3 +3K^2 + 3K +1 by Binomial Theorem8 R* K' U% L0 Z( n/ g
Then we have (K+1)^3 – ( K+1) = K^3 +3K^2 + 3K +1 –(K+1)( p5 x4 w7 y& p: `6 D* |8 N; `- S' o% H
= K^3 + 3K^2 + 2K
; c( A- T6 L; `& h+ O N- x = ( K^3 – K) + ( 3K^2 + 3K)
4 H. B" I5 w3 ^$ z" J6 `/ p/ C) C = ( K^3 – K) + 3 ( K^2 + K), p& f; s3 Q1 T8 z" p# `
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
+ ^) `2 q# P: e) ^3 ^- zSo we have (K+1)^3 – ( K+1) = ( K^3 – K) + 3 ( K^2 + K); i5 g2 \4 S/ h0 ~/ B& ?
= 3X + 3 ( K^2 + K)
/ z0 J4 E$ l( }# i( ]4 l = 3(X+ K^2 + K) which can be divided by 3 I, ?. w% X! R& r& B/ Z
+ ?: a, h$ ^/ K4 A. S
Conclusion: By the Principle of Mathematics Induction, n^3 - n can be divided by 3 For all integers n >1.
, P8 q: w7 f- f" p( H
h G3 W; u. L: y7 t" {1 q[ Last edited by 悟空 on 2005-2-23 at 10:06 AM ] |
|