TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
- j: p" T8 G( _5 I% }5 }: t, m水风 发表于 2014-5-2 01:57 ![]()
7 r. [1 D+ `8 D) B3 x再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ! P( _, T# Y4 F: n/ s0 m: L- Q
0 P4 h' u0 [& I( {& R2 }# m
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.' F* V8 e% Z2 n1 \ {8 C# I/ W
1 Y; v1 K1 x; GThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
* w5 g. d) f+ d- t: q) C( P0 r3 k7 @1 f. D% Y
After being divided (n+1) times, Z becomes 1, since X is fixed point.1 t. s8 R# I0 z5 I8 ]2 h/ ?6 v! n
& h9 |& z# b/ H/ U3 W! ]
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
7 z. b% ]+ k/ U1 18 r, _8 @# t: e0 s0 B
2 7 3 1
0 H3 i2 N: P7 U3 79 25 7 1 . \3 _0 l1 Q) M. h) X# l; I
4 1021 253 61 13 1 0 l0 Y) C0 C' g
5 15621 3121 621 121 21 1
' J* L) o6 Y0 r! i$ a3 A
4 m4 T/ N$ Q7 N4 j
$ p$ b2 o ]! l! ~3 Q( _: t2 M$ B |
|