TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 , z; P8 r8 Q) A: e3 f; r
水风 发表于 2014-5-2 01:57 ![]()
/ l+ F3 X6 ~' Y# ^再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
/ N- x2 y' E2 D& ^$ @: f' j' R5 D/ G# C, Y
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.$ V, R$ d6 B3 x
% I3 D0 z1 b6 E7 `The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
$ z: T4 F( z2 ~3 C
& M& Q: o6 c6 f, F: W3 z/ _After being divided (n+1) times, Z becomes 1, since X is fixed point.' l, j T9 v* a5 d
3 J4 ?% B+ _# E$ D" t7 ~
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
# N* W4 V. O0 D" v6 ?% b* s* _1 14 Y' E% V9 x- g. {
2 7 3 1
G1 O7 i/ E& M a8 R4 Z5 f3 79 25 7 1
* O: j% ?* h8 c) h$ X% e4 1021 253 61 13 1
: k/ w# K& B: o# v5 15621 3121 621 121 21 1* A5 \7 Z$ x5 t. K5 o
, {7 ~0 U9 N; I! Y: Y0 P. B9 P7 E' }1 C. a7 j `0 C" F! I
|
|