TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
- v, W3 b4 L% o! \水风 发表于 2014-5-2 01:57 ![]()
- L8 t$ O! [% Y# n再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 7 U# K) k3 V H9 D; Q/ n, O6 C
6 i9 k6 m; S) u9 F3 b5 a B
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
- s/ {! [+ P$ w, R) c
0 d4 o' [' w9 \- iThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
+ _6 E7 N1 Q( ]& `" D
# a W9 c/ d( K2 x# J" OAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
' \% \' [& B- p2 U8 s* v8 _# e$ J* S% U4 f0 Q' f1 w: ^ w: I3 W# V
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X & W; }" p H* \( D/ \
1 1
- z5 t& ]. S B$ d2 7 3 1
1 x0 R* a; _! }# E3 79 25 7 1
' d. p6 S( S# I4 1021 253 61 13 1
3 j6 V! q. X* X% B0 W& M2 `3 n S5 15621 3121 621 121 21 1
+ K* |( t4 T' n( W( k2 a( C. O5 b, @( [& d! M" B
8 b4 B" D' K: v' W r) [ |
|