TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
, D. C. z! T S2 H' F8 o+ E d水风 发表于 2014-5-2 01:57 ![]()
/ c4 Z% ^0 l- W4 @4 B0 i再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
9 J; L& R: z1 L
$ N2 J8 t7 y5 z5 d$ nfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.2 `0 W" L, g$ B: }$ t. j$ t) K
* K, d) o$ C+ i$ K Z1 G
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.5 c& A& n1 W; c# _ L
8 m) o& k% K6 o/ b6 FAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
3 w! o" R# d2 `0 U2 |" D" G9 T2 P4 D1 _6 F2 `' X. z
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
: l5 ~! ~7 Y$ Q1 e x" |) F1 1
0 Y, k4 P2 x: z- T" h- \2 7 3 1 " x* }0 w) r! I ^* g
3 79 25 7 1 & ]3 Z b; b- D+ f6 k
4 1021 253 61 13 1
5 L0 G: u, ^4 l1 J6 Q2 x5 15621 3121 621 121 21 12 ?2 N4 D* l, W! o* B( u. k7 {
& s" s, G, l7 M( F3 f% N4 F G
% d1 h5 @( T: E% i |
|