TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ( z( |4 u( X' C; z$ |# u
水风 发表于 2014-5-2 01:57 / {2 }: q7 M8 z8 e& w
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
9 r, l* v: H: w% }! ]
& \! r& o8 p2 N9 t% N, Ifixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
2 m5 `' r* u& `5 x& K- S
: `% }& [! n! h4 @The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.) b2 {( p/ x5 _) }, J
5 N1 g' S+ q$ f3 [1 }' r. kAfter being divided (n+1) times, Z becomes 1, since X is fixed point.3 w; A" }+ `* l" s# M- G# v. R* m
! D. M N# c5 C2 D, _. An n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X . V- L& P8 h2 f2 l$ m
1 1
, ^0 X# P3 E: e% ?/ U+ X6 R2 7 3 1 ( f- b' m+ y2 ]7 f0 U4 q9 z
3 79 25 7 1 4 ? P9 U1 L3 J! T* k
4 1021 253 61 13 1
9 Q' L$ ?+ s" } q3 {5 15621 3121 621 121 21 11 b: N x3 B. J; j3 X2 j
& m8 `" \1 _$ W2 M- P6 Z6 t2 E8 P
\/ B2 \. |, l1 t' ?$ w |
|