TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 - Y. O, r* l) Y7 N2 _2 i8 ~4 C0 n" R
水风 发表于 2014-5-2 01:57 ![]()
: l2 I$ |( x, G/ j再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
, y6 D: V3 G E& I0 i
* B5 `1 V1 p+ A# C$ Y( t9 S. m% Gfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
7 [9 `4 ?! J& T* t. v9 D
4 n% K' }+ k+ H8 RThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.$ t3 o/ K- u' b# k
: [8 B$ d/ V: o/ \. VAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
" w/ P, x; q3 V K
4 E) j C' [9 H' m# z* R, v6 in n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ; c9 @2 O+ b; m! Q
1 1
' [2 K: b! b% b9 @/ k) i2 7 3 1 # ^4 @ r1 x& n! w' `, E7 g" a2 R
3 79 25 7 1 / m: h7 }8 T* O2 d* u
4 1021 253 61 13 1 , k3 R: X' q8 U# {! S( V9 r4 N
5 15621 3121 621 121 21 1
% J) J# | a8 ?1 o' i& d0 V* B" c! y2 b
4 z- g1 z" c" C( t |
|