TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 * g) o3 F+ B6 H; T5 l% G2 Z( S4 D
水风 发表于 2014-5-2 01:57 ![]()
8 i( k# r2 i( t) v/ q再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... + T8 A; j$ g v4 x8 ?( x% P
* p1 e* B" |- D8 R8 x- D
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
9 V4 e' ?$ C8 @* ?6 G5 g+ J. M2 `/ @ p5 |7 K/ h
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.4 C$ I( k( r5 R0 |; `
+ p h3 S1 }+ d1 d. E* M1 O
After being divided (n+1) times, Z becomes 1, since X is fixed point. b4 b Z$ P. J ~
" \5 k# D- F' J5 N3 q
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 5 I- h# s% W D; q6 b+ G7 ^
1 1
) t" f( B, J; u1 p- c; `% J1 X s1 B% N2 7 3 1
5 l6 w! K: g1 y. `/ S% B3 79 25 7 1 ; s3 j9 J+ c h( F- G5 f6 _# \
4 1021 253 61 13 1
2 Q- S9 n! k5 k$ f4 _* w& @+ |5 15621 3121 621 121 21 1+ U8 \4 s; \" O, _$ b0 ]+ D7 ?
4 d- C& p9 M/ L, W7 f2 f
: n- J1 T- P q$ X: ?7 i |
|