TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 * M$ ]4 M0 u- Y+ v' y _
水风 发表于 2014-5-2 01:57 ![]()
6 }% } w: e& \" \3 A$ |再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 7 u" D; f8 z( i2 X! Z% a$ n
* w: I) n1 f8 S% w8 q% t7 \+ afixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.7 \, ~! K8 m0 y! S, ~
; @- x* W' b5 N* Q, a4 p. F
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
. V0 ^$ Z$ i0 M0 X4 @1 F) O& ~$ G
After being divided (n+1) times, Z becomes 1, since X is fixed point.* n, i; D) j3 ^2 X
- S; V( a) ?5 X* f5 B" P9 en n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
3 n& Z! s( `- [, i3 a2 F: m2 @' X1 1
% I7 A$ ]8 ?4 e7 ]5 |1 |1 |* c2 7 3 1
1 X- ?7 {2 P8 E+ z1 ?. o1 s! [# n3 79 25 7 1
- G B% B6 v) W4 1021 253 61 13 1 : y5 k9 ~/ K( Q
5 15621 3121 621 121 21 1) Y& T; M" v# ^/ X6 U! K1 {$ t
7 y- \1 E, b2 E2 v/ M5 e+ ~0 M4 |! {( d7 c& V- u0 C
|
|