TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
) o f' ^, a7 I; n1 m, N4 I) u: J水风 发表于 2014-5-2 01:57 ![]()
8 i4 o+ o5 M2 k5 E( ]4 {再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
9 z& N$ `3 M5 v& Q' }$ E- a7 O
, R* X8 p9 o Z' [- Yfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.$ Q, T @. X" y% S/ r8 }
8 T- p" w* R7 |$ E
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.' x+ d0 u b4 _( @1 K
) ~; u8 O O/ I' b ZAfter being divided (n+1) times, Z becomes 1, since X is fixed point.$ f( V/ x4 Z$ d* n; r2 ]% B$ c
0 R/ |. D; H' O4 i) p2 Zn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 3 `, r1 O( F5 M" ?
1 1, |# b9 ~" N# ?5 h' L
2 7 3 1 " A. |- q$ ?9 v% c! u& d; }
3 79 25 7 1 - v0 O( k0 B& @. h% }7 j
4 1021 253 61 13 1
0 ^+ Q9 I! d d0 `, c5 15621 3121 621 121 21 13 b) Y4 F7 v7 S2 V6 b _* y
$ G! f( n; V: |, H! H- f2 |% y. i# L5 d4 W$ @
|
|