TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 - P* S' S2 F; \0 r: D
水风 发表于 2014-5-2 01:57 ) l$ w( U- [$ g' e4 s% y
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... % B* ~; }# O8 H0 \% [
5 G8 J0 H. D9 @& I( R- H+ T8 k9 K
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.9 D! w* G+ o, D5 u; O8 T, Y
% B' s, \4 H0 j" D4 ]
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
# W2 S3 U/ u, A: k# x
5 D3 h$ [8 [* P6 V& s, J+ k3 b/ LAfter being divided (n+1) times, Z becomes 1, since X is fixed point.; ^& M6 K h8 F! ]2 c0 S
& g7 u; k+ Q5 B2 M
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
; e0 u# G# M# |, {* ?$ o% v1 1
0 `' _1 ?7 b. n2 7 3 1
; e$ k/ v4 Z4 @5 ?& a/ V3 79 25 7 1 `+ }! s% v1 p( c, R+ N, Z
4 1021 253 61 13 1 $ n$ s; q" g4 ?+ }! K2 }3 b- H! |
5 15621 3121 621 121 21 1
& p1 r$ w1 j( `# V, ]. _1 v
4 |5 n: D" {8 ~8 B' R" w9 }0 z% e# D6 \) w
|
|