TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
! [% f+ `$ v3 o, _4 C" F# o水风 发表于 2014-5-2 01:57 ![]()
8 k& X" ?6 S& C e. S再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
6 ^2 {& A* x m5 \$ y. E. D7 y/ U( x1 o. w6 l0 h( S
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
* w% K. s, i5 H' o& ?/ m0 B
4 n0 G3 u, x: s+ D; k, |+ t, qThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.# f A. L; O2 h, d) }4 `
( u7 y* l" Q: v; ?
After being divided (n+1) times, Z becomes 1, since X is fixed point.
1 ^2 j) t" Y" ]
, Z3 i+ j' t9 N4 D4 D2 B* Q3 \3 Ln n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
" @7 \, X9 `$ G: ~0 C! Q1 14 V' F j6 K$ g/ [$ v
2 7 3 1
7 s* k3 P- {( m0 y6 B3 79 25 7 1
0 @. @" m2 }* [; O; x4 1021 253 61 13 1 ' J0 C& l5 l( k! h5 B- x% _
5 15621 3121 621 121 21 1 S* v% G6 W# i
; h" [/ A& Q! P( |. q: O3 |/ \. ]) d0 l" J1 E
|
|