TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
3 w# |6 h% i& q& m9 w水风 发表于 2014-5-2 01:57 ![]()
" z: w2 f- r: m; S1 I再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
$ d1 T! J9 ?. N" H H% C
/ {) c* z7 e6 _9 w0 m) J& gfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
7 @/ u' m4 ]! p: h8 w* p5 A0 J. R+ C( ?! d4 `
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
1 `' `0 G3 D, L7 j# D2 a
! g- ?8 [1 }0 f8 I3 KAfter being divided (n+1) times, Z becomes 1, since X is fixed point.5 X/ r [) E1 i$ }7 m4 I% l- Z
5 r" l" k0 I3 H# ^
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
8 f- V) U+ @) Q: j5 `1 1
& {/ i3 ]7 t* u. F2 J& ]2 7 3 1
. N( x7 d$ k4 m( |9 h3 79 25 7 1
% M5 ~- E1 t7 A' I) t$ z3 A3 z4 1021 253 61 13 1 3 U2 T; p" C: s- b0 b
5 15621 3121 621 121 21 10 u! p$ @2 X0 [( \, ^
' p+ r7 t- @, j! I3 V
8 Y( v: D b' U$ C3 U a
|
|