TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
! D1 Y* R2 ~: t7 _1 O, N4 L水风 发表于 2014-5-2 01:57 ; W( S" [" T( R+ d- y3 T
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
. O/ u0 F/ }1 Q- m2 X9 p2 |0 e, j
9 Q* b4 a8 O: f4 C q" j( h* Nfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.7 A; S* A$ M, P5 P- K9 @1 g0 Y
6 X9 `8 E: j I& ^, @" A; N
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.+ I; X& E4 \) N9 P
# m: L( E4 s( H3 D8 c3 t* M8 C
After being divided (n+1) times, Z becomes 1, since X is fixed point.1 h$ n8 m. t, P8 K
& Q V0 Y) h3 y1 V6 k' ?& {6 On n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X $ V5 \* r$ W h3 ]/ b" T
1 1
! D3 E# K( @+ [" H8 l5 ?4 l2 7 3 1 # ?9 a9 u( H0 ]) V& D
3 79 25 7 1
; _4 X; v6 b3 Q6 u) `) D8 w4 1021 253 61 13 1 5 S7 V, u+ ?" @, N& p4 e7 h
5 15621 3121 621 121 21 1
+ H4 ?9 o: j+ C( t: I+ J5 ~0 ]/ i, b5 _/ U, k: C
4 V: J/ n0 P y7 J5 ^
|
|