TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
) L+ X2 H0 F/ l" x* }: ]# f, D水风 发表于 2014-5-2 01:57 1 q, k/ {8 \1 @. _; Y( H6 ?* v
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
% F+ b$ U2 y- x
1 b4 D# c6 N- C1 O! j+ qfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.6 d T; N% ?1 i4 l2 f
6 a" v" E" [2 L% }$ O2 {' AThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.; F9 j/ V8 E+ `. E# a
! n& b3 F/ |9 g! B
After being divided (n+1) times, Z becomes 1, since X is fixed point.: M$ |3 G& o0 J: Y. ?
7 z# B4 W' ^& t
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X / u6 H0 M; z5 Q3 a7 n1 ?
1 1
: Q+ ~) U! v z/ V2 7 3 1
5 x1 R( M1 @) O% _: a# H; w3 79 25 7 1
1 E& D3 x. a" [3 O6 E/ Z6 p5 c4 1021 253 61 13 1 1 b! S( L5 o& t2 U+ r+ a6 y
5 15621 3121 621 121 21 1
8 I. \6 h- o0 j3 u* \) l5 y
1 o2 O- `7 U$ S3 N' _5 K0 c* o" g& z6 ]1 i
|
|