TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ; X! ]$ K1 ^. W2 \
水风 发表于 2014-5-2 01:57 * U+ \4 `/ D7 M1 O. x2 |
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
; u5 ^( n8 s: o, y$ Z( C5 @1 f3 I
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
' Y) O% D3 d6 L9 z5 L2 G; a: K& U* F6 h7 z3 E! }6 {
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
* d( P% r' m, o9 q+ L
6 j0 r- _: l8 @1 n9 o) @! kAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
3 u- L+ W" i) t* E+ R+ k
9 N) X: X9 b4 E9 tn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
$ ] @- _/ s; m; v: {, g1 1$ t/ G: E* L. G7 W7 k4 G6 Y! w! x6 o
2 7 3 1 8 W- Z3 f% t* u0 a3 `* f4 ~) Z
3 79 25 7 1
/ x7 ]0 d) g( M4 B4 1021 253 61 13 1
" }: J4 |% Z: l/ S, g5 15621 3121 621 121 21 16 @7 m. @1 }, ]7 O. e' r
- o- v1 F3 t; I
3 D; V8 D1 y( K$ G+ [$ q |
|