TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ) ~0 H# n; g$ K( g1 Q2 H
水风 发表于 2014-5-2 01:57 ![]()
) L4 l7 o( L& T- t再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
) n# T. u: L' v: J3 w' s
( ~; d2 H* y; xfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
' ~/ d* h' h# [6 t
' V$ {" A8 u4 v6 G, G1 L/ zThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
9 }) u" w0 w( q) ]& Y: r) m5 h U) y+ A- |$ }8 x( M) E
After being divided (n+1) times, Z becomes 1, since X is fixed point. P) B& {* D5 F4 F5 c# o$ t
1 ^& _2 d( o, A/ S* a, k
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ( h+ l- k0 i0 w$ r7 m
1 1( V( l+ C# V" L, ^: j
2 7 3 1
- j1 d! O$ N2 j7 y9 s3 79 25 7 1 + ?5 D- F8 [2 x
4 1021 253 61 13 1 & c m6 d8 \ p( {' R7 v- X
5 15621 3121 621 121 21 1
- e6 n3 [6 M3 ^1 o: g) e/ w0 O" P: _5 K( ^3 L
4 W& ]8 C2 t: S# G6 k
|
|