TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
8 X u: @1 [8 S* f2 \+ q' b水风 发表于 2014-5-2 01:57 ![]()
+ t) N! i" E% h% z# ?, \% Y再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 8 H- [4 g- Z6 C; Y5 z' _
, q6 \, Y# W; K1 D
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut." h9 F( ]* Z. l( G
. n" b' N5 T* K( w; D
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.* n: ^# f4 p2 b- p; \/ B( r
9 v8 y8 t9 Q7 y7 d- [- x' Y) v
After being divided (n+1) times, Z becomes 1, since X is fixed point.( J1 M2 o$ a' K4 K& @, |
$ {3 `5 }/ o3 ]0 d$ h! y
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
) O8 N5 o' p0 W3 d" Y1 1/ T9 A1 e% G3 l3 ~
2 7 3 1
, O5 Y: z) g5 M: H3 79 25 7 1
d3 C. a3 c" J$ N& b0 s4 1021 253 61 13 1 " R- n9 H# g0 y3 r: F
5 15621 3121 621 121 21 1
; M( l; x Y" V0 X& S
7 R, T& y) E: W$ k- @( x( f
" a- a& {3 h4 r/ `: n* e- F; \ |
|