TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ' D4 @1 J; Q8 J# l! M
水风 发表于 2014-5-2 01:57
+ H, x |/ c/ @( m! k再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
7 U: H& q- | u/ A' q
: K6 ^" B( {; D* Ofixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.$ K) v9 T& T9 r7 _
5 L% t8 n0 l, v5 u: U9 O
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times./ B* _8 {/ C6 M/ Q; U9 {6 V$ R, p {
6 z8 R1 ?- }2 R4 N# o8 CAfter being divided (n+1) times, Z becomes 1, since X is fixed point.$ u2 p& W/ _ C) d! n- [5 z
6 t- f) i4 @( G$ Vn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
* ?( X" h( E: q7 T1 1
; j6 }5 e% r$ H( Y2 7 3 1 6 A% n( G3 _: L. J
3 79 25 7 1
" ?( F c c+ w7 k/ p4 1021 253 61 13 1 & v* y$ X/ Q3 [. {4 [) |7 X
5 15621 3121 621 121 21 1! _, K& b9 i# |4 b- {
/ i" P3 _9 J$ Z5 x( L
1 `, F, M; M; {3 T1 w5 f. K |
|