TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ! @5 s$ |: I6 V4 `+ v
水风 发表于 2014-5-2 01:57 ![]()
7 i3 V" g9 [3 T1 I再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ?2 k, m/ ^! h e) i
: d! T6 u; a. O. Xfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
9 P! V; o/ Q/ p: F. ~5 e8 D. v# n) a
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.0 {, F% u- H& `+ G/ P
7 w' q; p0 T5 e0 H3 I+ LAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
O* ~- s6 E y8 q o* @( N: N1 L+ Q5 ^
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
, @% U) X% P u, l5 f( U1 1' ?) h& J7 o) s9 v
2 7 3 1
) x: ]5 ?! x8 r7 m- z3 79 25 7 1 8 s. i: W1 R6 i2 ^
4 1021 253 61 13 1 % |1 e: N5 |7 y7 `7 y3 a
5 15621 3121 621 121 21 1" @& E. w8 e" b8 k; f2 W' ]& j+ x& c# K
: i1 V; L1 L( V9 w. e. _
; G, l+ a5 B4 z/ {5 |" Q
|
|