TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
8 Q; g# l" k$ C水风 发表于 2014-5-2 01:57 7 e. A" u9 a3 X9 ?! ~' P3 S
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... & M/ J, h( Q8 S- E9 e
- s. D+ r$ j. g$ s9 F$ bfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.- m& f* D/ u- K; I [
|3 ~: b" D3 _ a
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.5 `7 S9 J K0 P! b. o7 Z. l4 |
" X6 P, i$ r" j0 E" J) W9 R2 m8 q8 {
After being divided (n+1) times, Z becomes 1, since X is fixed point.' ?9 m2 {+ T. Q
" k9 S7 C9 X6 a* R% |; r, `
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
. e- S' `7 b7 H! i1 }- t$ e1 12 V1 J% R* Z) e) T) s- j
2 7 3 1
. X' R2 X! R. K1 ]4 A3 79 25 7 1
4 [1 X2 u( a- t1 ~" e! M9 r" ]4 1021 253 61 13 1 ' Z4 }0 a% H h- z$ x3 o
5 15621 3121 621 121 21 1
' n) K9 E% n3 X/ S0 M% g0 h3 o4 S( e1 ]4 S! A( z
1 }2 {% e' T" ?/ l
|
|