TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 $ c$ v. z* k% ~3 a& `% q6 b- x" @
水风 发表于 2014-5-2 01:57 ![]()
) X: ?: q- h. s, u2 D* j8 a再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... - P6 z) ]9 |; q5 q
5 v1 X6 n1 E. G7 s
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.$ T! `( ?# J( o7 @
( T4 D% L; m4 m$ C2 U% q& D
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
6 ?. J, w1 G9 N: |' {
- Y4 C. g) t0 u6 z. _After being divided (n+1) times, Z becomes 1, since X is fixed point.3 ?, I" v8 ? Z& I1 H% w$ @/ _
9 c8 H/ u$ c7 p# i) K2 An n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
5 q5 R7 V7 A+ y' w# B* }* }+ s4 l1 1
3 C" f: E3 A" w0 x1 `6 o2 7 3 1
, S. |! m7 d, _3 79 25 7 1 ' b( d5 f# f `$ l/ |6 M H- l
4 1021 253 61 13 1
" N" f& Q5 j$ C5 15621 3121 621 121 21 19 j* U4 k5 F- s1 k0 _% w: w" u
( B8 Y6 u7 {) `5 Q5 H$ [4 _7 J7 B$ B+ W
|
|