TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ) E$ R2 D+ G$ h8 J! Y& S; q5 T) x
水风 发表于 2014-5-2 01:57 ![]()
/ l5 C M; O, f, v2 y) r# m7 G再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... / c. J* _; E) z9 H* S% \1 z4 |
# X0 d0 I5 T) C' c! m% afixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.1 {6 j, b0 g$ E8 V t- U
. o. T6 [5 A$ F5 ~: G/ p5 u( YThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.* x' X9 c" P& L L4 P( [! K
( p7 B6 o' f; Y% b! L2 W4 s9 J
After being divided (n+1) times, Z becomes 1, since X is fixed point.
1 r& F# {# V! ~
$ p9 L! n; n6 `4 w/ c2 R. X2 fn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ( k# k1 l Y+ |; Q3 W9 r
1 1( L8 e. S% l* F2 Z
2 7 3 1 8 d# l5 s9 I/ x
3 79 25 7 1 5 I4 b+ i$ ~ B0 R8 u! m* I
4 1021 253 61 13 1
7 |+ b* c0 {2 h% y0 S& F$ h& i5 15621 3121 621 121 21 1. ]8 u2 t; i# V
: ]! W+ Z% e+ I" k8 T; b
' G7 t0 y/ s2 I8 x! h* `, {1 I$ N |
|