TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
3 {9 ~4 G; n* Q& B. I( U: e水风 发表于 2014-5-2 01:57 - h6 [2 Z* N( u1 w( I' V
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
' u, N0 X8 Z1 F9 S4 T: p4 x; D* B4 d9 }" J6 ^
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
! K6 Z+ O/ e% z5 ?; u
! r# P+ L2 _. SThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.: k# F7 i. \" i2 [
- {% Z0 Z& }6 [2 n7 Z, z( `. X
After being divided (n+1) times, Z becomes 1, since X is fixed point.
- Y% b F$ d* R! G: l4 R, i7 Y* S
( }; ~- C& P6 z& I; M4 E, Gn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
. t% f8 a3 i. h- i! V/ M1 10 Z. k) z/ n7 Q2 t# A
2 7 3 1
( r0 d: b. i5 g; H! v/ H3 79 25 7 1 0 t% c/ p& y# J- s1 d2 [, T
4 1021 253 61 13 1 - \+ D) ]/ L7 `& Y8 \5 a; j
5 15621 3121 621 121 21 1
! a2 Y6 l$ d+ O5 V) @* I0 Q( z6 y. Q: p! r/ h7 K
Z4 Q) Z; C; @5 ]9 h J: m$ {# W |
|