TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ! J; \1 @, i1 K
水风 发表于 2014-5-2 01:57 # C8 i0 a! o; K8 Z6 e6 H5 ?
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
* ^+ @4 s" ]- _+ Z& E& W0 C+ u: U) W' I: L+ p- C
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.; z, q' F& l) I [4 X8 B! g
5 F- |. v: F* u* s+ d- ]8 lThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
1 D5 O/ e, K N1 F* E! `% l) i/ X! O, n) [
After being divided (n+1) times, Z becomes 1, since X is fixed point.: @1 h. m+ k! s" f( S3 O. R
6 p r4 l: Q7 Z6 k7 d- i% K! ~; `
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
) L5 G y2 r( z/ h% d9 a! Z1 1
( b+ O$ J: {0 R8 ~ F2 n) r, }2 7 3 1 . e: v- [) {- o" ?
3 79 25 7 1 3 L( ]: u$ L* ?1 q0 T0 F5 K
4 1021 253 61 13 1
- Z; y+ x6 F2 O" |5 15621 3121 621 121 21 1# _! l2 D/ ?" T) p( Z0 i- V3 x, _
P8 j6 ~. q; q4 r; H1 o# G2 U
7 q' k* b8 n7 O1 c2 d |
|