TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
$ ~6 L4 d0 q# Y$ p9 E% p! t水风 发表于 2014-5-2 01:57 ![]()
, s$ G1 \; Y# x9 I6 y2 z8 H* Z再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 9 P8 V3 i4 _6 l# ^& \; k+ y, b/ C
0 J/ ]2 L# X9 L9 J0 i0 }fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.( F3 c1 P$ X# e
* q9 c# c) R% ?4 u& @$ vThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.5 J* L! H4 s; D, s" l* q
r) _( X# _ K; Q) |6 iAfter being divided (n+1) times, Z becomes 1, since X is fixed point.# I9 K" {/ K L" v7 O
: D( Z0 R( e+ y; x( W& H! P
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X # f6 w8 K+ h- \" h+ d2 F, I. R
1 1
0 V n$ b g" `; k) T0 _# G2 7 3 1
. W; ^2 @, |$ r+ N: _ z- J3 79 25 7 1
/ q" X. N& g; v% S) d5 E; H4 1021 253 61 13 1
\# Y3 T1 C- q+ ?+ q$ r- p5 15621 3121 621 121 21 1
. \7 n+ J) M U$ H
4 \! @; f5 S5 G3 O
% f' c6 k( O# `" H; u |
|