TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
. j) H" n6 I# U; Z+ r: D$ X( n) E水风 发表于 2014-5-2 01:57 ![]()
! k6 s5 e6 o& }1 k/ x再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
8 a5 H$ m* U( G9 \ \
' u. p( J6 ^. m+ Dfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
5 ~( @1 I# {4 p0 O2 Z+ B9 A4 y2 c) b# V7 }& Y' [" o+ f. k
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times./ P2 K# r& F% I x( S, @
$ D& m' e/ J$ D- e4 R" S* b, n# U5 m% cAfter being divided (n+1) times, Z becomes 1, since X is fixed point.! |. |" W* c7 m6 Q+ Y' x
y, X i) X$ @1 ]+ \1 nn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X . {7 s- @" }- I* m
1 1
" j" g5 U5 p0 t0 U2 7 3 1
- s- V" T" B' _! p. m8 z3 79 25 7 1 0 k! A( L. j- `- p. g* W
4 1021 253 61 13 1 ! {) w& U, F# B2 e* g0 a4 @* j: c
5 15621 3121 621 121 21 1" @2 Z# @& _! p- q, F/ x
- ^3 y! ~* Z/ y* Y9 b* g6 k
3 w5 W! a4 a% F' _8 B2 h |
|