TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 . x" H& |3 F. K6 ]- ?
水风 发表于 2014-5-2 01:57 6 j1 ^: p/ b& B% c0 S4 m* r
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
$ F) W8 d6 L) m! i2 e6 M& W m& `& k x4 m6 k9 e9 \$ S) Y& K
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.: T Y. ]0 e' W# z% z/ k8 K
7 I9 i$ n9 |- ?' n/ Q
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.- B2 o+ [/ m2 p) n
! V+ L: ?' w8 vAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
& _* ~0 |5 z; a8 h. G' S; B; x1 A: x& {3 ~& q4 ~
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X / m( P: X$ w5 Q/ a5 j9 Y' C
1 1
% j9 x8 N/ |* U G2 7 3 1 . q9 E0 D/ r7 J" P) l; ^; b0 P
3 79 25 7 1
$ l5 K* v* K% g5 v) V* `4 1021 253 61 13 1
3 {$ s ]# Q5 q' A# p' e9 r$ o. M O5 15621 3121 621 121 21 1
2 I7 T0 P" F7 K, S& K# M5 I, `/ |8 m
# Q9 P- r5 K6 V. w8 M+ w" G- L |
|