TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 7 c/ x, h9 ]2 S3 B8 \ u# J, M
水风 发表于 2014-5-2 01:57
) X8 ~) F5 V6 }' \再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
9 M' N) U! [% ?4 ^5 n% r, x( k$ M) g9 P
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut., _2 A, z! _6 x* ?& h4 U2 G
" ^' _- b' y- B& z( U1 MThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
" g: ~( T+ ^* S# N7 l6 O
$ k# X* N* p/ _; g: c# q# l) D! }2 uAfter being divided (n+1) times, Z becomes 1, since X is fixed point./ d R) Y% M9 {6 Z, c
4 t, R, M3 A. ^* D) xn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X + Y7 i8 r; {' |' t; P3 d- m# j n
1 1
: {5 j2 Z9 Y5 _2 q2 7 3 1 ) z! y6 w' Q4 p3 z, _7 e5 A& P
3 79 25 7 1 % E0 z8 B% N t, R
4 1021 253 61 13 1 ' [& O, W& a$ }5 u
5 15621 3121 621 121 21 1
! r+ c- j( v9 v5 S; Y( a; o$ @; a# T- r* x
7 o+ f* ]5 b' |: E5 J
|
|