TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ! w+ m$ Y% T% J. G* l
水风 发表于 2014-5-2 01:57 ![]()
+ ^: c- G3 c6 K0 |( J再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... " A( E$ I: T8 f# T5 ?/ Q
/ ?2 g0 y6 H/ h8 R; x! [$ J& qfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.+ E9 p* S5 \' ^& k2 a+ F; x6 ?
; d4 ]: A, K* _( d: M. T8 J: RThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
+ b4 [- f9 P) L m' \9 Z
* R: s+ c7 j8 w( W, |After being divided (n+1) times, Z becomes 1, since X is fixed point.% B3 l9 R$ G: [
" n% `# _% V4 L& p V* c. l) _: A
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
0 k* A* x2 C( Z1 1
s h2 Z& i' g1 S& y2 7 3 1 7 \& h3 C. G0 u% t8 P
3 79 25 7 1 4 j( U% `- J+ V3 }
4 1021 253 61 13 1
) G; b4 o* e* q2 b2 b9 |5 15621 3121 621 121 21 16 t2 L) d2 e2 p! A5 A/ C
" W' V% S( M2 P9 x
' X0 g( O$ u$ | |
|