TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
! ~$ M n1 o4 Y6 q" @3 y水风 发表于 2014-5-2 01:57 ![]()
9 I+ u; s/ R+ Q% Y7 [再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
9 T9 I, g- G* p: x: h+ D+ g5 `2 K- D6 B# x) O* _+ }
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
' h! k! p- X% ~. I K" @# R7 @: }0 m8 J0 ]. e
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
" f' L/ f: A- @( B) ]
' [" x" R( r4 V/ o' F2 l- E% SAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
& h0 q1 p8 T# F5 p7 |/ G0 o. M6 T& f2 D; N
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 9 N! N* Z' l2 ]' k) b9 \$ U" @
1 1
3 _7 Z8 M8 ~" T- _) G2 7 3 1 * F. b0 q1 Q! L4 z
3 79 25 7 1
( O$ {( B7 H1 X6 k4 1021 253 61 13 1 " h9 P- e/ t9 Z: t
5 15621 3121 621 121 21 1
# V$ ~9 Z) i1 x6 |
6 `' F2 K9 ]2 D0 z( Y* Z+ `( o- A6 H- n. R9 t& p7 f T0 P$ k
|
|