TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
" \% b# N, O" g) Q* Z: q! M" f) E水风 发表于 2014-5-2 01:57 ![]()
9 X/ ^) B3 ?/ K* c再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
5 K3 e- p5 v) U$ j0 z) ^0 C% }. @ N9 x+ {/ M( p
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
8 I3 ?# z) _: _- E/ r( J' F6 ~4 t* E6 v: x; Q! ^- M# }+ Y3 K" B3 N) _$ j
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
9 l* k0 D! g! B1 c* U% \1 Z; a. L E8 I& A
After being divided (n+1) times, Z becomes 1, since X is fixed point.
1 `3 a2 f6 g. s# q7 @/ o' h4 y% |: v" J6 w& B8 }7 G
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
8 n" e9 w4 W- C1 1 D) r" T; t8 P# r% l" L4 q
2 7 3 1
$ U# Q! \0 a2 S. h% w3 g" B3 79 25 7 1
& j& M2 c/ L& ?7 M r' t0 z4 1021 253 61 13 1 : @+ j5 Q6 s d: t8 N
5 15621 3121 621 121 21 1
+ `! c3 j$ ~) O, ~+ _% ], i# X# q0 H* K; @5 P
9 A6 @" x& f J4 E6 w
|
|