TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
5 A! O7 K* V& D' b3 E水风 发表于 2014-5-2 01:57 , r% h' o& g" x$ E1 _: Q
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... & v5 v5 M: A9 t: i- o1 h
& z, G/ ^1 g, t& g. D
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
, n8 L6 g- X2 q$ Y- `6 [: R1 G$ v9 j# w& b
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
4 ?0 n4 Q! Q9 O' {4 E5 [+ d7 w
" w+ U( N) V. I5 q" Z: X- ?; uAfter being divided (n+1) times, Z becomes 1, since X is fixed point.; G! t1 ^' X4 e p; W- Z- Z9 y n
$ T; @) t* y8 a2 f3 U4 @% i, o; mn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
! c: X5 v- |: I2 p; |* p1 1
. d) s7 S; Q0 G) w2 7 3 1 & G# \0 @) ~7 Y2 \/ ]& g# t
3 79 25 7 1 5 I2 S \) I/ x
4 1021 253 61 13 1
, c# J5 T6 P9 V" u) ]5 ?. o5 15621 3121 621 121 21 1' U G( I- b, E& }
: w1 m: f* [. N3 e3 K) J; Z
9 |+ l$ k c5 K) t. _! N0 k, G) v |
|