TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 % d( @0 z' Z, Q; [9 x7 d3 @
水风 发表于 2014-5-2 01:57 ![]()
7 A" ~$ q% N% V/ M再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
( b4 N5 N& u C3 s, [, S6 D( J# D3 }2 Q. j2 ]6 l y
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.. K( ^* s6 i& g! @0 X, A9 A( G
5 g2 c6 c$ e0 R- G, L& H; c+ D
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.; n1 M2 x3 L( R1 c
; n# ^0 B: z) I7 Q/ T' }, l
After being divided (n+1) times, Z becomes 1, since X is fixed point.% O) r$ j( M* a3 u) ]6 b
2 m+ X$ t3 n6 ^0 ?5 Cn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X & d1 r$ a8 h, X3 \9 Q) G# S* |1 ?; }
1 1
& t/ A0 ?: d' d6 C0 T2 7 3 1 * f+ I6 j, [. {. J
3 79 25 7 1
4 @0 x0 V6 I1 X2 ]8 [4 1021 253 61 13 1
" p! s3 R1 Y4 H5 15621 3121 621 121 21 1: }+ i3 l: u+ G q% \3 _# m/ w
0 x- b" f: X/ R; T0 y+ m# J
) }6 a/ `- x* M
|
|