TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 9 `5 C' E8 W* k) C8 q
水风 发表于 2014-5-2 01:57 ![]()
0 @9 F3 m, T: K& O再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 3 \2 ~ ]/ [$ |
5 D. c# e, p+ X# kfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.! v: m. [# m& Z, X9 P& }
6 D" @/ D/ F* G' ]! `) p4 G0 @The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
# F* j- x: K N9 a
# D E' F/ |/ M# A7 i6 eAfter being divided (n+1) times, Z becomes 1, since X is fixed point.5 l6 ~* z) p0 v5 o0 p5 ^2 ?1 r
! K/ b1 z: p4 I# cn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
3 C* i. g# y. q" _1 12 p# D0 F' }1 A2 w6 [7 d1 S
2 7 3 1
; a- w5 \3 g' {/ v# g4 y5 Z5 n3 79 25 7 1
; _1 a d z R. b7 j4 1021 253 61 13 1 # K4 y5 q F% t% ~# c! _
5 15621 3121 621 121 21 1( H% F' I r; q1 k5 Z2 A% x5 H/ D
+ |& d# x: V6 X; d; e9 G5 C" Q3 ^
1 g% G% A9 S, D t0 [ |
|