TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 9 Y$ ^+ {7 O- ?+ O
水风 发表于 2014-5-2 01:57 ![]()
8 k0 R$ O3 S% J再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
7 V7 I u: k2 A" ]$ q
6 ~& V! c S0 ^4 E0 e% R; Y! |fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.9 W. C* }9 o+ c/ q: \& M8 a
2 D# [. t7 D q0 g6 w
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
" z# x! N, U9 M* c e5 Z% V. x0 m% T1 G0 S; }; k* B
After being divided (n+1) times, Z becomes 1, since X is fixed point./ }/ e/ H& F f& s% c6 u
$ r H: l6 c& X) [3 }# Z
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
/ Q- b* M- O; s; Y$ T1 1
8 L! k, Q: x7 X1 I- O2 d v' C2 7 3 1
1 V$ Y* q9 R$ r3 79 25 7 1
& u. H, Z+ c/ m/ U& R4 1021 253 61 13 1 4 H, u& g3 s% b" @7 ?+ j3 k0 V& V
5 15621 3121 621 121 21 10 I( b4 u) w6 @1 \- v9 C
8 a$ L3 w; c! r: ?% D" q( f. _" f8 L' ]6 K t
|
|