TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
$ w+ e$ p9 M9 D: |( j$ m水风 发表于 2014-5-2 01:57 ![]()
( ^8 r- E) E. r( Q b( ^4 _, ?再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ) V, l! ~% b. \. I( i
1 E7 Y O+ D' \& N
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.: R! ]/ }* D, H
0 D; G/ J& L4 ?+ k4 v9 @# YThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times. C( P5 q/ g9 O/ a
9 a2 a3 w1 \* Z4 i# N" FAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
' \( m2 a- ?* G, q3 z; Q& d) y7 Q
' e2 T% y! v* E: Rn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
2 q. E5 U. ]4 o3 I3 M1 1/ r( z7 w0 T1 c8 M1 n* q
2 7 3 1 $ y) S7 t7 w6 A$ x: b* N- C
3 79 25 7 1 1 Q, C. d. k: T9 D* e1 j
4 1021 253 61 13 1 / z' N: n% }7 c2 W- X O
5 15621 3121 621 121 21 1
2 T6 Y" p' t) c) s8 D8 J
7 l9 [( ^" x3 O% v) g+ E5 e) b! l; p0 h- ?
|
|