TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
" C. y4 M. i2 ^$ W/ ]水风 发表于 2014-5-2 01:57 ![]()
- C3 O1 K2 v t8 ?% n再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
& P; D8 P' ^# q
: F" `$ S2 }, b' j4 _4 }; R$ ?+ Jfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
. h6 H; K( @; Y U, }/ \5 n: a% K6 r; S2 Z- r& E1 w1 P }
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
5 N& C- l3 r2 X/ t& J3 C) j
- g; i8 b& k8 v( kAfter being divided (n+1) times, Z becomes 1, since X is fixed point.3 K K) ^7 {% }5 U1 ]2 ?0 R/ n
- ^, y& K* G( U9 \. v! `n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
( s2 R% L) y- V$ J- T( i1 1
d) X4 ]/ ~4 H" p" t M: x9 T3 v2 7 3 1 , {4 {) _ W8 J3 v- ]# r& k8 ^
3 79 25 7 1
1 \& B" X- E% ^$ {4 1021 253 61 13 1
/ ~7 k c& u* {; _5 15621 3121 621 121 21 1; K) k: o* e, m( T6 y1 X ^
, X7 k( D& Z6 Y' J6 n" t
9 n2 i6 T5 w4 x
|
|