TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ) F. w' o2 I$ J5 N1 a1 s8 {4 v
水风 发表于 2014-5-2 01:57 ![]()
; H' c+ q5 y* s* X$ k再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... / C- f% ]9 `5 r3 Q6 j0 ^; e* _
5 d: a- x; f4 ^0 B, T7 q" O- N, Y+ Dfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
3 o$ U+ M- `& E, {+ I; A
8 L) Q& V5 F3 e% C2 Q4 ]2 ^The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
( a3 v/ N$ O* m! n
9 p, E) _; @) c* N; ^1 P& lAfter being divided (n+1) times, Z becomes 1, since X is fixed point.7 l. H( d2 B' J; A5 x; ]& Q) @
$ ~, M+ L' c- E2 X* h
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
5 N: [# m% @6 u; O. s8 b1 1" E; o, \- n1 u6 H K% g
2 7 3 1
3 V# z( v6 \# f [3 79 25 7 1
* ?* j* R/ a: r! M2 ^- K4 1021 253 61 13 1 ) l2 X( }* r7 N. z3 S
5 15621 3121 621 121 21 1
# Z, {% S7 G$ N; I% I9 x' u9 L, d) W
' M, w3 A; _, S |
|