TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
7 I& }/ @2 M$ z" P% F* [水风 发表于 2014-5-2 01:57 ![]()
# S, \, A) J1 E. k再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
: ^) E6 u: S6 B( L9 [
' C6 V/ E- q$ A4 T x; yfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
; E. r* H+ I0 t; ? J) d
: ~: N5 N* ?7 ^& f. \2 f: gThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
! H( C, _" F' s% A+ y. A2 d9 d: t
. u Y+ |2 x7 w3 M$ r; ~1 oAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
X. ^8 }2 P0 u
1 h# J; v( B# G! y+ d' {$ pn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X + G7 D& E8 M1 T& S; s
1 1 F3 ~2 J7 _, s! x; f
2 7 3 1 + v. f* _. F7 i, M' x
3 79 25 7 1
5 U! j0 F0 c6 P1 [& C$ |4 1021 253 61 13 1
/ J2 A( O& O" d! y0 m4 d; t! C5 15621 3121 621 121 21 1
0 H7 y; p: q$ ]% M @; |, A
0 W2 @% J$ ~8 t8 T6 s+ C) t3 V& c1 I$ g. d" X
|
|