TA的每日心情![](source/plugin/dsu_paulsign/img/emot/ch.gif) | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
e1 O# j/ L+ J- l7 J$ b D8 p* Y水风 发表于 2014-5-2 01:57 0 I2 T& ^0 b4 w7 k0 w' r# t
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ( R( i0 w) A0 m# z
* ~$ e8 N8 r; x+ Z0 y' Mfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.3 L1 Y# A6 A+ v3 J# c% {
0 U$ m) @2 R# Z6 f- B9 q% x
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.0 z" X+ u- j6 x( |+ R. i0 l9 b
9 n3 _) S: W* c2 |) h' |. B8 tAfter being divided (n+1) times, Z becomes 1, since X is fixed point./ U8 c& Q; N6 c' ?8 q. m, k( D
* e1 c! J" {: }, K- F% }9 Q3 Kn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
G, Z( k) x# |) ]" I1 1% a5 p: h: x/ _; l) s! v5 i
2 7 3 1
7 j- G; M/ g% h y- [3 79 25 7 1 ) U8 m9 U3 O- n5 W" t* I; Y0 w
4 1021 253 61 13 1 : c8 g, L3 \: B, Y! w4 k
5 15621 3121 621 121 21 1+ R' M: p; N$ C. w. J( S. t
0 q8 P' C% A) C( ~6 {% H3 v5 l( G! Z; ]
|
|