TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 1 Y. z6 b/ b4 w0 L5 s w
水风 发表于 2014-5-2 01:57
1 B8 n1 v3 f/ U; o3 ~再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... , ]" \' A" \3 ~
- Y! d* c& W+ Qfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
. S& l* E- M/ C `2 | H2 U# o6 E; Y# |5 m% J6 y- [5 c* I) t5 y8 y
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.4 u* A0 A9 A) z5 q4 `. M
. g: U% Y8 V; e0 u7 ]6 m
After being divided (n+1) times, Z becomes 1, since X is fixed point.! B$ x' K$ Q" x8 K- X& e
) H/ I4 _4 i% V! ~& Y
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
9 i w2 L9 p2 v) _% A1 10 s0 B. x2 P, j6 I$ z; T& S
2 7 3 1 7 W& Y% P2 I, V; ?, o
3 79 25 7 1 / T$ R) w5 O, h- ?' s* _
4 1021 253 61 13 1 ; G' x' Y, [+ x" g1 h
5 15621 3121 621 121 21 1
0 R: X/ W0 J4 V, ^9 x/ ]3 ^
9 L% X# M" Y9 q) K4 q% |5 ?
5 \- i2 ]5 O* T5 n& p8 ?' i |
|