TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
F ~2 p3 a$ n. b8 `* M( m水风 发表于 2014-5-2 01:57 ![]()
, a6 D* K' s! J6 o0 g+ L再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
. }- _3 u, v! k% [8 b" h8 x, R" p" n* U
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
3 Q" U3 @$ ?6 k+ F0 q6 F k, k0 ?0 f. A* ?
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.; y3 D8 C7 V$ \' ]9 E) g0 C
' e' s- ?4 j" I8 l" y; p
After being divided (n+1) times, Z becomes 1, since X is fixed point.- e, m5 d a* G1 I8 e
5 `) U5 ~2 r; k+ z$ L/ M) R" l
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
5 `8 A4 y4 T7 {0 O1 1( ^6 x; z3 K u; Q. B' X- |
2 7 3 1
5 h2 C' j G$ d; T) E3 79 25 7 1 7 ^8 q$ F$ E4 p3 N/ m
4 1021 253 61 13 1 7 n: `1 V/ t" H! {7 Y# }. T" k4 z
5 15621 3121 621 121 21 1% B6 d j5 L5 ^
: B" N( U6 G+ j) N: C6 y- r
& t7 E7 J {' F6 ^4 A! L) g |
|