TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
- k5 z" `7 ^1 }4 P水风 发表于 2014-5-2 01:57 ![]()
/ S, R: b0 K9 r7 ?! K9 K6 b再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 8 h: C3 K# Y% }: A
0 @8 b! y. I) h* Yfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.4 C2 H) z1 ]- w0 b
; }8 X, q+ x5 ^5 `3 q
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.$ B- x6 x$ `+ ]$ B+ ?) M) U+ d3 j
$ v4 F- |, [3 G. b9 E
After being divided (n+1) times, Z becomes 1, since X is fixed point., v& N7 R- Z( x7 n P
7 {4 Y/ S. U( O3 y
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 4 g! m9 ^7 f. k% d }
1 1
/ d; O1 _' c2 K; o2 7 3 1
- w8 Q6 H9 ]9 I+ }3 79 25 7 1 8 z3 X$ g% H! [# h1 I1 o
4 1021 253 61 13 1
5 e; U; k0 _! b1 T& C5 15621 3121 621 121 21 1; b1 K- M. r$ `8 P
8 v' |* |3 I. J
7 H; A) m. R) m2 O |
|