TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 3 B2 G1 z( `; {8 L& c% i. @6 K5 w
水风 发表于 2014-5-2 01:57 ) l) V( D6 N/ D
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
3 n6 p) q M- G& x+ v) Q
% J9 T6 }% _3 f# }; k& C/ h+ @fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
, F! j& V& |; M$ f& Q: I# b( i+ N& h5 }: H& `+ p5 [
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
9 J! A3 T9 l3 T! b) \! z. z# _4 j- e0 c8 Q
After being divided (n+1) times, Z becomes 1, since X is fixed point.
& U5 o7 q1 y: i% @( y0 o
, R, e+ n( H( _0 Q0 Zn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 6 z2 M5 Y e) c- a, d
1 1
5 j$ [. B s' f- t) }& S2 7 3 1 * d' b; V1 g) m# t& \& i) x2 X' m I
3 79 25 7 1 & I/ L/ @, L; i
4 1021 253 61 13 1
2 p n' M, a- q2 v5 15621 3121 621 121 21 16 }! F5 d6 P' L2 n2 S/ V7 A
7 }7 {3 U6 n/ b! k) F: L! H: N4 D0 I
|
|