TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 * g, c8 e- t/ y/ l" j w+ B
水风 发表于 2014-5-2 01:57 ![]()
1 h, B/ O1 ^+ l, D( \; L! k0 c再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... " ~5 d3 j" |2 N. \7 }) Y9 e
; x' r" D8 n( e+ P; b. Q# _, Xfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
' u# g& O$ x p- a5 t: n- z; @8 n0 D9 w9 J8 C
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times., G9 m* w; N6 K3 _* d) h$ z
; t9 ?, ]" ]) c2 w$ y7 z* }6 Z! SAfter being divided (n+1) times, Z becomes 1, since X is fixed point.2 [) a+ z7 }$ W) l# e
: v1 f- O7 D# c/ Y* I2 h( }' `n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
: i) D# Z7 J% X( R5 K1 1/ ? l: M, b& v7 x, u
2 7 3 1 " p @& {: Z$ a1 v
3 79 25 7 1 6 m9 P, r$ n4 F; o
4 1021 253 61 13 1 F/ C( x* `- d- b% K* U! j$ N
5 15621 3121 621 121 21 1! v' ?9 K& p! q( W8 A
+ Q7 M2 Q& w/ d( { a8 M$ p
7 d% G2 I" [- S) G8 B" q& y1 `: k( c |
|