TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ; Z( b- i! x4 A1 m, n& `
水风 发表于 2014-5-2 01:57 ![]()
( x) l' b( G. z1 H3 ^再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 2 h+ P7 X T% T
3 H4 K- M; _* O0 N
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.! p. _* s5 x# `; b% r" b8 L6 b
- s* [% o# {" tThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
0 K- \5 K/ a6 g
R; \) G( c+ sAfter being divided (n+1) times, Z becomes 1, since X is fixed point.6 \4 }5 B# Z$ ?: u2 M: r- f
: B& f: n9 I6 @( y7 K$ T2 cn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 1 p8 G9 A( x: G* V$ |: N2 b/ d' p
1 1+ E9 n+ b$ M, t* O$ `! s
2 7 3 1 6 i G- J: w5 H' G* z7 r
3 79 25 7 1
/ F; X/ @; @1 ?1 N! o4 U& q4 1021 253 61 13 1 3 ^. W3 a9 U" ?" o9 q+ d: b
5 15621 3121 621 121 21 1, ~) J! f& g% w1 `5 F
, ~# \5 g1 h% Y1 R% [% A; G
2 @ J- }$ g4 v H8 D |
|