TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 . o, R9 [! v1 Q) c7 B
水风 发表于 2014-5-2 01:57 0 `* ]! c- f8 _, y
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 7 T; v6 W% C0 m- e
* c" D/ b! j, b2 N8 ?* J g! }' Zfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
6 k5 f# ^5 d. I, [- u2 q
, j+ K P+ L0 z2 a% q- PThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.9 Y; Y9 R! p0 |* t7 {
/ V: Z) B3 W) v
After being divided (n+1) times, Z becomes 1, since X is fixed point.
8 \( t& }- K; Q4 l- f- X& Z: J+ P6 a5 J7 u8 D6 c0 A7 V0 r5 H
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X % T/ D* P6 d' f x# i- E7 ?
1 13 @8 {) L4 k8 f- ?* M
2 7 3 1 1 z& t/ q% ~5 H L7 t8 S
3 79 25 7 1 " m, k; N2 N5 p' O% @* k0 B
4 1021 253 61 13 1 & [6 B/ v. s4 z
5 15621 3121 621 121 21 1
- k% p4 S5 a: _4 s: ~; @/ P) t$ W/ d, f# U6 @; x# F( d
2 ]) Z4 `8 q6 z8 {1 ` |
|