TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 J ~; y: Z' j
水风 发表于 2014-5-2 01:57 7 D+ D8 Y; D( V- i/ U
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... , \0 e8 g7 ~3 U5 O8 s; f
5 F- g# X. H, Y2 v- x
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
6 i' ]( O7 d# {
+ G- G0 A2 U) N: v# b0 R- B0 A EThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.& R% }$ Z& v l* k
3 `+ e, z# Z: J, NAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
9 s/ \+ I' Q- j4 j; R
* x0 K' F4 f. v- Q" W/ In n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X $ @# s0 k, ?2 C- X! [% s
1 1
+ O$ r# V, j. L& N1 H2 7 3 1
, J* E& U; i) @; b: I5 M, F# P3 79 25 7 1 4 g5 I& m1 W. Q# I0 g L
4 1021 253 61 13 1
7 {) W" J6 e; {/ ~! ^' n; P. ~5 15621 3121 621 121 21 1
8 {$ p6 F5 g8 W$ M2 m9 r8 v1 a* L; q; {9 Z \& {3 @5 O, q0 p
& g4 g2 x& a4 [( j( ]3 l/ p |
|