TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ( ?5 S% g& [( H) y6 I; {: W" `, C* S8 Q
水风 发表于 2014-5-2 01:57 ) N5 H* p2 q" p; P' }. L4 v* {( o
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
5 A6 |5 ^" R" t1 H/ Z" |- E2 I/ i2 C$ B
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.' z$ E1 B7 }' W9 f* i1 \$ t
- ]; }3 m) c+ b& r& k* Y& h1 nThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
) _. Q( Z- J( f9 c- x/ q
3 w& r, W/ i5 YAfter being divided (n+1) times, Z becomes 1, since X is fixed point.. Y- B: ]0 Q6 _) W
3 y) C$ ], k% S5 f, a! rn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
& f0 W, w1 [: J1 l9 C2 x$ F6 C; s1 1
& w3 H9 j' O, v- f2 7 3 1 5 H5 R9 ~ G u& ^, n8 C
3 79 25 7 1 : Q/ D% f- h5 s7 i L
4 1021 253 61 13 1 ' C: x$ w/ ?. j2 j) B/ W& ^
5 15621 3121 621 121 21 1. q% c' w# [8 S/ N! G0 g8 y2 R0 f
* \" u2 ]$ H# a
6 |* ?: D2 i1 ]; V# }9 I |
|