TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 , i9 g' t. S) m9 v4 J+ I, J
水风 发表于 2014-5-2 01:57 2 |, c! A; c$ b7 f' v. l" K
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
, @, p* ^6 v* ?
" X9 P7 O/ S( r" cfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
- g, c4 k* I, X: @
+ ^: R( e* Q/ Z! v+ D& F( SThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.. A$ ?2 A4 j$ n6 S! f0 P
6 }+ r/ T) S) W/ }6 x$ B) g
After being divided (n+1) times, Z becomes 1, since X is fixed point.
$ V# O a- P7 R8 {) c
. I1 F+ ?6 Y4 [( Z$ N/ Pn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
O9 n8 ?. ~, x1 15 w; L; m% ~1 b) _$ {; E# P
2 7 3 1 - B$ d- I$ R. O( u7 | r3 d0 _
3 79 25 7 1
- ^; |7 z5 b& j4 1021 253 61 13 1 . l' j" ?, o i8 X5 Q
5 15621 3121 621 121 21 1" z/ j# i/ p$ B
) Q) L! E$ I# p2 H% c& |, h1 ^" P5 B4 R5 m
|
|