TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
" V( M' `# d$ N; k3 z6 |水风 发表于 2014-5-2 01:57 ![]()
" O& f% ^- `. t2 r再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... # }3 ~& w5 b( K( J% L5 n
, x. F" x. m: F4 b
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.4 N) `( O; u8 K3 ]$ c- l
# R4 C1 f5 I7 ?0 s% Y! b( a
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.- z, B' Z" E% @0 ^6 K
8 z! W- n8 u$ _ CAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
7 B$ R' m; I4 E$ {& K) h" A; s- j3 A- k1 f+ F9 z
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X + `( p* }) E0 [+ @9 p
1 1
8 R. B1 J9 A4 d! B' i( F2 7 3 1 8 P! J& p2 f! |6 b& B" @$ r
3 79 25 7 1 7 ^8 ]& s! r. E& Z4 b" \1 r
4 1021 253 61 13 1 " w9 r# _) \ b+ k* N8 ~ e! D
5 15621 3121 621 121 21 1
$ Z- `0 t( W4 @, ^! Z) s+ ]
4 k/ Q- I* R& S; s( F8 m
+ f' J4 f! _1 r |
|