TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
& W4 P# i" K2 {水风 发表于 2014-5-2 01:57 & [8 [. [/ J5 D% _. \* ~
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
; t. B ?1 w7 N+ A* R9 i t. l8 B4 ~, F3 d# a1 B
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.1 P/ U- C$ t3 A$ s
9 ^ D% E$ U* n) f
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
7 l$ j! E! H0 W: N' f
0 M/ M2 \% Y$ N5 n/ EAfter being divided (n+1) times, Z becomes 1, since X is fixed point.' N# E1 A" e! Q# [) J
~# Z; e; W. a. o1 M3 Yn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X # U9 b" _3 y& l: P
1 1
* F: [' b" J0 k9 p$ F0 f# y, S0 F2 7 3 1 # G& `: M* g8 e6 ?/ G* m. _4 ~
3 79 25 7 1 ! Q7 _$ w7 q$ F* m! [$ K0 r. M- C; s
4 1021 253 61 13 1 6 B1 o0 F/ d _8 j: Z' O6 z' I
5 15621 3121 621 121 21 11 B! R; [: l+ f1 { D
) {$ q0 P6 U8 f* d
n; q6 S) s8 I" l* ~ |
|