TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 + b9 w& v; {) M5 |/ l2 [
水风 发表于 2014-5-2 01:57 + p, o: T) V" ~
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ! L7 G% v \: \+ J! M4 m Y
0 X E; M- k/ A/ y4 ?
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.2 u& P/ p6 K& [: u6 D* G3 s! [
' A4 ]- M$ _9 ]8 t; |' [The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.8 G4 Z- N% F1 Z
9 U! {, @) p" @6 C# J( M
After being divided (n+1) times, Z becomes 1, since X is fixed point.$ M8 v# \3 O) f4 n% D- b; R
' v7 A" C* T$ Z5 jn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X $ K2 p! y* h) ~) q; k/ [
1 15 |: L o/ Y! t, M
2 7 3 1 ( `$ x$ m) u9 o
3 79 25 7 1
$ v& d, d2 w) q4 1021 253 61 13 1 * b9 J @/ T+ M; F. j
5 15621 3121 621 121 21 1. n; O1 |7 L! N$ p! W; q) U5 s6 K
7 y# v: {* o3 {- F
9 ~& O* [& [+ v7 H |
|