TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
1 `2 S8 m* W$ |& ?/ e5 c水风 发表于 2014-5-2 01:57 + Y6 N/ `0 J# \0 h
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... A: @; `( Y! W* n9 o% W
. X5 d& x% R, ~, w0 K& p* O p
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
: a* |" R8 C* G% X% P7 f. F
# q( I5 o0 q5 k4 `The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times./ d2 _- R7 a, u
% y6 m) V3 K0 E# }" _0 D* V: {After being divided (n+1) times, Z becomes 1, since X is fixed point. ?! H8 z: }& q/ C' W: f
$ i! m; c1 C9 i7 ~, h
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 4 Z1 H0 v' }" G
1 1
* s2 `0 \6 N' d: t6 N8 }2 7 3 1 ; k: r- @- p+ W: Z- e6 s/ v
3 79 25 7 1 * x/ c ?# u5 _3 }5 A" t
4 1021 253 61 13 1 % S! c/ G- i% y' Y! K
5 15621 3121 621 121 21 19 ~. i% n* R$ `* w! L
/ n' I* S% u6 F) F, b& J: ]
& M# v/ p+ i( a& _" C
|
|