TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ( C. \6 O& o; k. q' H- y
水风 发表于 2014-5-2 01:57 / ], u6 {' ?6 k: V( ` y* Z
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
1 d( H6 y7 m6 H/ t! z+ z2 p& Q; p( @6 {$ F& u
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.& D# u3 Y- `9 O
* [$ a6 e0 v3 U* T
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
1 U+ q$ L% g% @# B Y: j: \; L9 f5 E( d, G/ x) f0 @' [8 V
After being divided (n+1) times, Z becomes 1, since X is fixed point.
8 Q; R' `6 J1 J" x' p v* \. p6 F6 z _6 k1 L
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 9 \8 A- P, P# ~. e$ d: A4 K
1 15 f% N/ m4 c1 o8 x0 |
2 7 3 1
/ l- y" M- d+ N8 J( o3 79 25 7 1 . r" e" O: g1 E G' v, v
4 1021 253 61 13 1
1 m& z4 g4 F$ @& v; K) h5 15621 3121 621 121 21 1
& C3 H% n! U- Z* H3 Z* |1 ?5 P1 `: f" s. _+ E
, d8 L5 C. x( C$ C: x2 n( \ |
|