TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
) W1 r! k) _/ {% ?/ L7 v水风 发表于 2014-5-2 01:57 ' f" x8 `7 b8 n6 `7 t% B
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 9 Y* `# A0 J' P& U
5 C0 e5 P0 ^3 @2 z2 t% |4 G3 v7 d# |$ Nfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.! W# ^0 [) Z4 r
4 m; D5 n9 H. W3 c7 N! v+ o" ?& O
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
7 o& T1 c2 g9 V: p# O: y" {5 ]7 [6 Y$ Y9 m' q
After being divided (n+1) times, Z becomes 1, since X is fixed point.
$ \: m! M8 `+ w* `8 l$ Y2 [
4 t2 M4 \7 v* q8 k' Bn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X " U5 T* M& f! K! Z
1 1! e2 t1 `( J+ `/ I/ W/ Y/ `
2 7 3 1 ! B0 q1 k" q2 w4 A
3 79 25 7 1
S1 g* S- D& I4 y, Y/ G7 l4 1021 253 61 13 1
0 a2 u$ Y3 S2 `+ d( G5 15621 3121 621 121 21 14 y3 p. K6 T8 W5 ^. R: ~- y% x
" M4 h, h, N; c, J. j/ h8 V! v! ?/ b8 Q
|
|