TA的每日心情![](source/plugin/dsu_paulsign/img/emot/ch.gif) | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
F& O6 }) j, d3 L水风 发表于 2014-5-2 01:57 3 `$ u' S$ g9 u' o
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
, T' w0 P0 W9 C) R. u0 r4 ?) e" G: Z
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.8 C }7 F3 q) A0 e& j F
; w/ B' ~" J+ a4 x C
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.8 A' u" t6 F7 v9 I
/ X+ p1 N- o$ H: J# a; y/ y8 M; C
After being divided (n+1) times, Z becomes 1, since X is fixed point.
5 M) ?6 w5 U8 X' m2 E) e
H- D$ B* W- V" Sn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 5 o3 Q; u$ X& q- r3 d$ B3 L
1 14 T( L5 x3 z2 [! x2 W: k: |1 J
2 7 3 1
6 q* p2 `# l' |/ |* M. s7 o/ Z. Y3 79 25 7 1 7 O$ Q) x6 m+ P& w: g) u+ d
4 1021 253 61 13 1 ' e9 ^) j3 {6 W2 D7 v2 Y8 U5 ]6 B2 H
5 15621 3121 621 121 21 1
9 g" P( o* o, n" ^1 D! w7 q: [& G$ \. k/ J
7 t" _: H H3 W/ U$ U1 N% C
|
|