TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
+ O4 [( m$ \3 J( z N6 G水风 发表于 2014-5-2 01:57 4 y" `: t# X$ I# s( D0 y
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
4 x7 Y3 _8 X: n( v1 A% F8 D7 [8 J [ Q6 U; Q! u/ G9 p
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.1 [" a& H/ M/ X4 A' R
( _, d4 R8 @( }8 O/ }) S0 o, U( W
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
4 i. v- z2 ?3 j0 J2 w5 S
4 ~* T9 G) G! c2 @$ h! eAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
U) z9 Y# B6 D( y1 N8 y
9 t$ L! ?3 S9 S a1 L7 Zn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
( }. m ^4 q# N1 d0 D1 1$ N8 u2 q. A! F" b. ^. a0 N I, q
2 7 3 1
! @+ Q& v7 B2 N. ^' d- Z! g3 79 25 7 1
7 Z8 v+ J7 }8 G: e/ A4 O6 R8 [4 1021 253 61 13 1
6 m" B P" m: D& ]! I5 15621 3121 621 121 21 1
2 B+ x/ Z% ]% r J$ Y7 {
. W5 `8 }3 G) ]& M" \ h9 x+ S6 i1 N! [8 e7 q& Y/ \# w& q( X y( y
|
|