TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 % D( Y+ Z/ m9 v, L {! ~
水风 发表于 2014-5-2 01:57 ![]()
& r& T( p" f0 n O0 D5 z2 w再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
2 X. {5 H) @1 L' _, |7 P8 ?2 c! ^, t. [8 a- n4 B) o
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
$ k4 O! X$ P- g4 ]
+ M! ]$ P6 `9 r' X4 W+ O% Y( R5 mThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.8 ~) G0 N. ]" r6 x6 J: \
" k% o1 M2 ]) v# V% T& f3 A/ f' i
After being divided (n+1) times, Z becomes 1, since X is fixed point.+ w9 |* I x8 M$ X* \# N
) k+ x) E( H5 V' C0 n2 mn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
' b& t! b+ t" B4 u4 y; @, Q1 1
* ?* D! y* \; H: k2 T' v) g7 Q2 7 3 1 9 \6 `) e: c2 c7 }2 R
3 79 25 7 1 # X; z" v+ ~+ x# [
4 1021 253 61 13 1 1 S; }$ p7 n; p: k, y/ E" H7 i
5 15621 3121 621 121 21 1
( I* b/ c' q6 g$ C7 [
; }+ l/ _9 b" M; e6 g4 r I9 Z2 G3 b: e3 @* s8 E- m
|
|