TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
& q. c/ U& G! Q& P- b R7 @ t# t水风 发表于 2014-5-2 01:57 1 ?. U5 s7 E& A- G# J& X/ e2 `
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
. F7 m5 I( v$ a% N" T9 M% E) k% U" F( y3 F6 H
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.! ?1 q/ y9 S g0 P& `: d
5 z0 T* _8 m Y7 L
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
% b+ p4 J J( a
1 h: Z! C' H1 s) g6 a+ E1 Q/ [3 DAfter being divided (n+1) times, Z becomes 1, since X is fixed point.+ G; ?2 q Q) [$ _
" K) E" D$ g6 |4 |: s
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
/ P' ?& W' c4 T1 [7 w' d, i1 1
$ b8 Y9 o- H: W8 E. q* {/ O2 7 3 1 6 N- G0 a' G! J4 [/ t
3 79 25 7 1
9 k. k; {. _$ g( f+ i' R; T; U4 1021 253 61 13 1
) N( h9 L% }: d6 ?8 P, _: B: e. @5 15621 3121 621 121 21 1
1 r7 q# E9 H4 [1 _+ ]: E! F) r& E3 K; i
5 v9 r" {; _/ _1 c, J |
|