TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 , G7 \3 v* K$ N8 B& Y8 J
水风 发表于 2014-5-2 01:57 3 N( e- u; m$ n; f* f3 T7 R& R2 \
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
4 K& R3 c2 P& L" }- B) _
( g( h! n7 Y: n# mfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
; w, t: x1 G3 e9 Z( {6 g; n
8 n( }7 d Y z5 tThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
' ]. ]& `' @. x; B: F; e& I
/ G2 R" o% L; N2 I* aAfter being divided (n+1) times, Z becomes 1, since X is fixed point.$ Y: r& @) z* \) _1 \+ [
& R( U; I/ w, ?6 g+ V1 T( [' P6 }: \n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
$ [) Y; H3 R# T8 A$ R4 r1 11 k4 k2 b3 {% a! f+ E; ?: g
2 7 3 1 ! A' U8 Q3 w F/ T+ \6 E
3 79 25 7 1
( Z# }! \# ^4 i" i+ @5 Q2 S# u4 S4 1021 253 61 13 1 ! z+ G0 D4 Q) Y1 A
5 15621 3121 621 121 21 1
3 _& n: t8 y" L; ~/ k
4 T% J9 R, A% n. ?+ X8 ~
; i) [$ f6 }) p" V$ d |
|