TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ; n m9 l1 M. Q) m+ c
水风 发表于 2014-5-2 01:57 , i2 J0 Q$ ?3 J: h
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 5 y1 D- Q T! h Q$ g [1 I: W
1 L# S. h# O) u, Y6 |
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
8 x* @3 P7 k4 w8 X) [; A6 U+ O. K @4 X2 e8 N
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.+ h- m) H0 _ [
* y% L h; M* f. I/ `4 WAfter being divided (n+1) times, Z becomes 1, since X is fixed point.5 |- C5 b) O/ e* }, \$ J
C4 v6 Y6 c! x( ~3 o
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X + F4 w1 ]" x2 e; m: h
1 19 ^2 F0 x4 M4 {8 n, P2 V# ^5 _# F
2 7 3 1 % V z" r& \- j% w
3 79 25 7 1
" z6 i0 }" z9 t$ i, }. F9 ]4 1021 253 61 13 1 : O1 R$ ~- ]. A8 z/ s x/ o
5 15621 3121 621 121 21 1; o3 v* e0 M% K1 k
3 B2 A0 z( y1 i9 j; l, w* F
. Y9 ?' _: d$ i* T0 ]4 X |
|