TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
0 M9 ~' Y2 n- ?- Z6 N2 S水风 发表于 2014-5-2 01:57 . @% {' R! Q1 X' i$ t6 k9 r
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
5 g0 p' S# F$ y. J3 Q) w5 b
, {$ R" O" }2 o2 S# k: ufixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.1 x. }5 K* s! T C
2 N, ?/ M) n( e; `7 ?) w' p
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
3 P5 {8 |5 M3 i. s! R3 r' q) ?
+ l$ C& Z8 K# ?5 n1 |, rAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
& s( i) A* ~& z/ `9 M2 m6 Y+ |1 P! q( H2 {3 Y
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 1 I2 Y2 a( h# [4 U! b
1 1$ z! f3 ] _4 j4 f
2 7 3 1
) i6 C/ S3 t6 |5 c# _( F: {4 _3 v# `3 79 25 7 1 ' U! H* `6 ]5 l/ w: K9 Z
4 1021 253 61 13 1
8 O9 d. S% p; Y: ?5 c5 S5 15621 3121 621 121 21 1' K3 a, J9 }/ V% X- V
9 x f* Z+ a$ ?* T# T" [ k
. \! Y% e' u. }. n |
|