TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
! l0 o% {$ P. G$ Z水风 发表于 2014-5-2 01:57 ![]()
/ ]( x2 I a$ U8 a! \2 U5 [5 e再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ' m' e* m: V! l) _/ }* X
/ |9 j- q* p! W2 i8 y6 Wfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.+ `3 X! {4 p) @* k) q5 z
, ]2 u6 k6 N, f, N4 ZThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.7 m; B' [5 [- T0 H6 M
. e( J0 H% N/ @After being divided (n+1) times, Z becomes 1, since X is fixed point.
i+ L+ W7 } `2 O* V) C. @! O* d6 @
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ' M6 i9 L. U! z5 Q9 r
1 1$ h; @6 A- A, b8 k0 @( O
2 7 3 1
. J0 w2 {- ^) T! O3 79 25 7 1 . h' Z6 w% W1 D% ?. s5 |! A
4 1021 253 61 13 1
$ }/ h% u! D! v) w4 x- J1 I: Q5 15621 3121 621 121 21 1
5 M, O: b( E& Z% \, j0 H/ @
$ G7 V0 B" ^+ p, @ @
- @/ }! D& [' J |
|