TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
% j$ ]4 L; `' U* i! b! C& O$ [水风 发表于 2014-5-2 01:57 ![]()
3 W% N0 z' g* s' b再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
9 U( B+ s; M! V1 e* m& }9 a4 m6 {/ [. J6 @
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
, S, ~2 W( ~/ t* m" o
) ^ C. a) M3 _2 d: U% EThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.2 s$ i: h7 N& o% M
9 u5 c6 C* E0 u6 c2 CAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
9 a& B% }0 X* t& r" [3 p
- f" g& Z4 w% j( i2 C' kn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 5 A/ P \" m! E" ~
1 1
- j8 z0 ~! S6 C! T1 l2 7 3 1
4 R6 i2 [% t* ]2 p3 79 25 7 1
* Q" |$ @ Y" z+ K4 1021 253 61 13 1 8 e4 p0 d& D r
5 15621 3121 621 121 21 1
2 f6 T" d: X% T* Y* O8 i; ]7 b( q- ^/ f
% M$ x; n1 C, p5 M+ e4 F
|
|