TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
& f9 B" P6 P. w. o! b水风 发表于 2014-5-2 01:57 ![]()
/ ?5 c+ Z$ G# V4 x# n再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... / L. e% K1 ~9 j! L# `
) |0 V7 h+ y+ U; F4 `# S S% @
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.* { h" b- ]( i1 D" h
' I% @7 n1 {! q5 n, g$ a' W
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
! N; ]) L3 B& j4 p
- m5 ^8 C. N! f* u/ ~After being divided (n+1) times, Z becomes 1, since X is fixed point.* Q9 ?5 ]1 l! ~) y9 x, p
* r7 I, x) `$ Q1 o! O/ t* _5 n# Kn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 2 u! s" x; m6 z. ? |8 j* G
1 1
5 Z! o5 ~% [( F2 7 3 1 * T1 P' M! r5 x5 G
3 79 25 7 1
5 D# o6 m0 p, y4 1021 253 61 13 1 / x L' W; [; R8 x
5 15621 3121 621 121 21 1 r$ u7 i; B3 a$ K5 m& K
$ A+ Z) s1 u# f! P
2 A) d( i1 m& r/ z" a |
|