TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 4 N! T! V; A+ H g- i0 t; A6 K! `
水风 发表于 2014-5-2 01:57 % h4 i( _5 l2 X, a
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... % d3 E! W- O% t0 q. O
2 p2 U+ p* d. V9 Ufixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
' L. J$ Y/ ~( j4 H: _: Z
4 Q: P3 u1 W" G+ xThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
2 V0 Z- P6 ^8 {1 e) b& }: D2 [2 T. `, E5 g
After being divided (n+1) times, Z becomes 1, since X is fixed point.
- v6 U) a% K3 G6 T9 i: |3 Y4 Y8 R5 u$ m0 o5 k' [
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
/ H5 u& L- L- c# u4 }1 15 f6 A* I0 y) ~; F0 O
2 7 3 1
% P0 m- u1 h+ z3 K9 W3 @3 79 25 7 1 , K* J* h( l8 p; |2 A6 q4 t
4 1021 253 61 13 1 , ~1 h* ]% D0 P) J& U( d
5 15621 3121 621 121 21 1
) K( G: J; @. n, `
1 q4 k4 N: Y% ]8 b
* i0 h% f0 A! q1 M0 \, e |
|