TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
" v( N7 q+ @. d( \, D水风 发表于 2014-5-2 01:57 % x( b ^+ q8 _, M2 m" m2 q
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
0 j1 x+ a5 e2 a* G" `+ Y( v3 h/ k# _! U. y2 g0 C
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
& l b& G' ]+ f" _" c
1 ~, q6 }2 Z2 H$ A: yThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.* ~& [8 p2 I: w) I" T3 _: f
0 G: m5 n& |% d1 W' p
After being divided (n+1) times, Z becomes 1, since X is fixed point.
) ^; Q$ `! Q" @' E# M- C- ?
; t/ z! m5 k- g5 x/ b4 T: t7 Qn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
o" A/ I: l0 f0 |% z) O8 ]1 1
, z# f* t4 O: M2 7 3 1 7 ?! P, d9 n' ?$ C
3 79 25 7 1 ' J l& u a. _! p$ q1 C6 W4 I7 N$ L
4 1021 253 61 13 1 5 f6 V. d; g: C1 d( N% t5 [! `
5 15621 3121 621 121 21 1 E9 o5 h$ L& H) h1 \$ m
9 M: b2 C4 K/ J, T
* O. D6 Z2 }+ B% D0 v |
|