TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
* N4 H8 w$ B4 W3 Q水风 发表于 2014-5-2 01:57
/ B+ E7 P0 x4 G8 T3 u! r再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
! D/ e! I' E8 C- {' }8 o: R* o% _6 Y/ M; T6 Z) c2 a( L2 q M+ d* m
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.; f6 y- g( w0 B D- w. x7 U3 @
, N0 W7 G! B$ s5 G% b2 S2 G. eThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.) E, e% o1 l/ M; E0 M6 r1 `
, I- w- r% i7 {) R2 wAfter being divided (n+1) times, Z becomes 1, since X is fixed point.! M- g/ x0 s6 O6 t/ z
; w6 _# p) x! ?+ n. |7 D% z
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ) d# D' p% |3 L* @7 g+ O/ M" c4 y8 `
1 1+ g5 l: F+ w: C3 F- x& e
2 7 3 1 , D8 d5 j* l' b d! _, D4 I
3 79 25 7 1 ( \8 b$ T/ a/ }. W' \
4 1021 253 61 13 1 : S2 h! B- q8 Q1 ~4 S9 W
5 15621 3121 621 121 21 1
: i$ S2 b, K4 W2 r, s8 P4 B7 V6 \' Y7 @ }% l& p
3 [3 ]% T* s# R% Y: r9 ~
|
|