TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 6 X/ E6 [& d. b0 O! s5 B
水风 发表于 2014-5-2 01:57 ![]()
1 [- @$ n) L- e% o: P; Y" ?2 u. m再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
0 n! F( U9 R! M
+ U5 q) h$ Q( ^% b) efixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
% |, r2 o! u# ?9 c t$ D+ J* t) k% j
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.$ e- P5 J6 Q2 x E- d; q$ R
& Q# d% C4 F5 q. {; f
After being divided (n+1) times, Z becomes 1, since X is fixed point.
/ c* @( k5 V' G6 H! g3 \
$ L; c. @4 c! y1 C2 F3 jn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
0 Z( u5 a T& S( Q- Y1 1
" j# T2 w" P' y8 D& o' E* ^( S2 7 3 1 0 {6 c- u; `' C( p' d9 o
3 79 25 7 1
: A0 \; q2 F! Y7 n2 W! _6 V) z* w" g: g, b4 1021 253 61 13 1 ( q1 u$ a6 f* F2 u* T
5 15621 3121 621 121 21 1
0 m+ C( j" H9 Q+ ~7 C5 d; n# T( V' y: L* m) Y) N
) s4 I: g$ j0 `
|
|