TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
6 y! E; L" R+ U) f$ T" f水风 发表于 2014-5-2 01:57 ' T9 m9 [# f% ]- K1 {% P
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
" E% d5 F5 D; g) [
1 q8 L( t: u$ ?' Afixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
6 p; @; \' F7 _/ U3 R3 }, f% ?4 s5 P7 v7 P9 P2 f2 p
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
3 x' N2 a* s+ _4 S2 e& r$ [- e6 Z
After being divided (n+1) times, Z becomes 1, since X is fixed point.
7 }" N3 A! A$ W2 K% }$ V0 R
+ }& w$ T1 u6 A- V m5 G0 ], _n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
, ^* ~2 u" G: \ f1 1) Y. K' K( g4 w8 m# y/ o
2 7 3 1 3 p% \0 \( s% t6 _- ]1 C: Z I
3 79 25 7 1
8 Z* V" R& o' l8 ^5 K4 1021 253 61 13 1 # y( m2 m$ `& v
5 15621 3121 621 121 21 1" v j) u+ E7 h. b
. P/ m* `4 u( m( K4 a1 H2 U7 j) r: F. q
|
|