TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 3 p! H& |5 g0 W3 ]. {! }
水风 发表于 2014-5-2 01:57
! M( U! m8 ~9 j# \, Q再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... & l' b# _% M+ ?/ K! _8 t/ g2 ]8 ~/ x$ q
9 K0 t/ {. C6 }+ T
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
2 D: G/ n% t1 w6 c7 s+ t& S% O2 q' A
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
M( j% P3 @. D* |) }. z! f; _, Z$ `1 G; E
After being divided (n+1) times, Z becomes 1, since X is fixed point.
# o: G7 W# c2 }5 }% F h
. b: T7 Y, i+ x! S/ h* M9 f& pn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
) \: a, T# g- H8 q9 m1 1( S( J _! x- o! @4 O5 } c l U2 n
2 7 3 1
5 N3 p% _; u. S8 c8 k C3 79 25 7 1 : r. D, [2 l/ j' g
4 1021 253 61 13 1
; d6 \+ R9 \! i+ L' ]$ w1 C; [5 15621 3121 621 121 21 1
6 C6 z7 W- o. V! S7 M
1 m" v) a0 P% k4 i0 O+ |9 a; [; F }
|
|