TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
( d- u0 A o7 i6 k" l' u水风 发表于 2014-5-2 01:57 1 {+ s, u& l( C* S" G
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
( Z! E9 H( `0 O7 r. T0 a; z: U! b! {3 V) B
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
. q2 \8 g' Z+ C" e/ w# R1 l! E. y( K0 b0 Y5 r9 g; r
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
3 f4 o, l( B, G. I P7 `. G; l: ?4 ~8 Q8 e' y1 ]
After being divided (n+1) times, Z becomes 1, since X is fixed point.
8 O+ p# ?( G8 y/ h' u2 c. i8 s$ n( B( P5 e
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X & E, p# b4 }7 }. I8 ~! F
1 1/ ?5 e/ m7 Z8 O/ X
2 7 3 1 + x2 ?- s$ M, X8 p
3 79 25 7 1 - f4 k, u0 @, s W# T
4 1021 253 61 13 1 / ?3 @1 _) }+ X" T e
5 15621 3121 621 121 21 1
/ D9 d+ Y1 p/ [/ u0 S
. M8 c7 p; b' a) L( Z; ~; Q
u% Q/ v5 I/ s2 y, o* H |
|