TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
% i- Z# e8 I$ R! {2 z; l水风 发表于 2014-5-2 01:57 ; f* x' Y& M* T- Z* |
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
0 y3 F& Q7 w S: q2 Z& _& M5 g5 v. ]) J. e& ]9 g/ I& t% @
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
. d" a8 E$ B, p9 R/ U& p/ M) A/ e: S" n. Y9 I' D2 J
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.9 ^. u8 @ ]. Q; m% R- H* U/ e
5 [" p: P7 B' R/ d( k" L8 G# y v/ WAfter being divided (n+1) times, Z becomes 1, since X is fixed point.% L8 M+ N2 Y5 p7 N* ~1 D1 l, _
! {; z- |- \. Jn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ) b/ |8 s: G# [
1 1
5 |+ j1 J0 b0 k, y: S- s2 7 3 1 ' Z# F4 n8 j4 Y# c" H9 D
3 79 25 7 1
) s: K4 ]7 [2 }; T' d1 ~- B& r3 n/ m4 1021 253 61 13 1
% W# V! ^: M1 f ~3 W1 h5 15621 3121 621 121 21 1
# `0 @7 U: ]; R7 S7 s; Q& q! D. H& o3 f0 V- u
% y7 X$ N j, x# G' Z) c# W. @/ u |
|