TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
# u, c8 ?0 R/ ]- u$ S5 S水风 发表于 2014-5-2 01:57 ![]()
" c( F b" M9 `& g再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 2 f% l% }' G, m) X9 b7 H- u
' o5 R, A# y: c' V! V( Mfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.% t, A- j q+ t0 a
6 S+ G% I* u' C' h+ T4 B) ~' o
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.3 ?! N% G i9 L8 F) Q0 F
& b8 |0 F* y7 ]* I8 ?& D
After being divided (n+1) times, Z becomes 1, since X is fixed point.. u i3 l6 S) w: Y' d
* Z* R& n# }' W4 d& _4 ^7 zn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
* D( h e5 \3 G) P+ i1 17 p$ N: }4 R. p7 S4 N, b
2 7 3 1 ( G& k0 t" ~+ t
3 79 25 7 1
/ `+ p! u, Z V* X m3 u4 1021 253 61 13 1 ' T% ~) X* r8 B1 k/ o, v' z4 @
5 15621 3121 621 121 21 1
8 M* E8 _5 h: p: q7 [( j- b- e) M Q9 l I8 M1 S" ~
( T3 A% V2 c/ G0 A. H# g |
|