TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
" m1 m! O: b1 g7 R& q5 c& N水风 发表于 2014-5-2 01:57 0 }; l4 u* j- _
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ! }4 d6 f* g+ n! C
% R$ ^; k9 b' ?8 p% a$ Efixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.- W* q+ @ x) b* ]
: q6 f* a. b' e3 F
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.+ `- L" _- s4 J
V7 o( F1 q' G2 yAfter being divided (n+1) times, Z becomes 1, since X is fixed point.$ }# T- x2 Y2 L7 y' h) ]
( G4 q0 t( a9 o' kn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
7 P9 \" U! C v0 x) R, J4 J1 1
: I6 R2 O4 E8 q2 Y( L" N, K6 O. p2 7 3 1
* n: S- B& U- V! m" d3 79 25 7 1
* q8 u$ @, {/ h% M' y4 1021 253 61 13 1 * l+ ?8 ^% F# P& S5 V7 L
5 15621 3121 621 121 21 1; X/ Y2 k& ?# m- u3 O/ N) @
" g* j. {! x7 s0 k: O! g
2 F2 C: {- ~# E. P+ `1 q
|
|