TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 6 E' o6 Q. |9 U6 Q6 X
水风 发表于 2014-5-2 01:57 ![]()
5 N0 |# W4 Z! h7 X2 |) i8 `" K: B6 n再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ; O. W0 ?2 Y2 A; Q, e
3 b% ?2 [0 A0 t2 ]! h1 J- C: ?* Ufixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.4 c3 f' m6 V% }$ R+ ]+ x
7 K2 L( }6 c( S! u. J/ j1 PThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
, g7 N% r9 l" ^, h( I! G% O! c @6 _1 q
After being divided (n+1) times, Z becomes 1, since X is fixed point.
) Q+ v) m$ Y. p8 H: f ]* v
. K! J8 G) V9 d! zn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ; J5 f$ p. _6 s) b- H
1 1
3 k! ?6 T" `- S2 7 3 1
, @' z1 p# S/ a4 |3 79 25 7 1
o( e+ v5 g& Q- H$ ]4 1021 253 61 13 1 ! ~$ g" B6 g6 a9 n: Q
5 15621 3121 621 121 21 1
" s* @8 J: i2 i) |
/ e4 {5 J& \, J1 H& b5 S. R! u/ I" w. r# E
|
|