TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 6 U8 ]9 @& P$ R- s8 S
水风 发表于 2014-5-2 01:57 6 a0 Z3 t+ a! P4 ?" z% S1 Z
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
, D9 l, I; E7 T2 v8 \& J
) H) }) U# U0 W3 jfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.6 G7 z8 d: G5 r: }
2 [6 G: K& r& m# L5 D3 I6 a/ t: X \The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
4 T. q* b$ H) Y8 T$ X5 S% ~" F. R, q" p: S
After being divided (n+1) times, Z becomes 1, since X is fixed point. P' Z& | Y X. i7 y& \( v
0 U7 L3 C8 | F" {
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X & J( C9 c$ ^1 L3 a4 l0 B! \" W
1 1
' R9 E4 K, L; }! f- p2 C. m2 7 3 1 * t) a9 U. ^9 B6 Q6 |4 c
3 79 25 7 1
1 u3 }, H' H/ x5 F4 1021 253 61 13 1 + G9 S* K/ }7 L- F; v" D
5 15621 3121 621 121 21 13 B0 e: U# X! k* F2 w' i
7 R" o' x+ [" ]3 L9 x* ?' l X
- e# K: ~1 ]& i. G% r# Y8 Z i/ K |
|