TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
/ I& X/ t2 L7 S2 N9 l& l2 B水风 发表于 2014-5-2 01:57 & V3 G+ @$ k( |$ [8 N% O
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
/ Y/ s8 {5 |6 I! H O8 _3 u( M, y. t5 z
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
* D _, l2 Z/ x. n* o8 ~" {+ g5 g6 D% k2 ~; Q6 ]/ \
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.! c4 V! [, {6 G
$ x( p# G) ^4 q* n$ v# l, K2 r: b
After being divided (n+1) times, Z becomes 1, since X is fixed point.
3 ?+ s9 ^: I1 g! j, a$ P# @* z
( Q$ O: U' T- k9 v3 V, M# ~. Rn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 1 g' h4 T* K9 I% r, D/ k
1 1
. | r: u9 j4 P3 R: S2 7 3 1
8 u% N. v% K' l8 ?7 |( }, O3 79 25 7 1 5 f( [) m# e% v0 E- S& D
4 1021 253 61 13 1 7 `- m3 K4 Y; c- N* ~) A+ e' I
5 15621 3121 621 121 21 19 X; ]8 p& s1 R/ ^1 ^2 [) q! z% i
5 ~# O( d0 k! k- t& E+ j7 Q
- Y) _% |- L. P: b+ {- ?7 g3 p; |/ Z
|
|