TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 7 f: D. g/ k; y- D
水风 发表于 2014-5-2 01:57 3 ?( a6 m2 ]7 z+ B: J
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... X, d: S! E1 A; ?9 d6 r( E
, j( l6 Z7 x7 U0 Mfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
P3 Z1 q8 Z& [5 ]4 g$ m0 f2 u. A; y) U
1 }" Z( M8 N* r1 Q5 S& Q3 _The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
) z2 G+ r K; N/ D- H
! Y: x0 p) A7 e+ N' MAfter being divided (n+1) times, Z becomes 1, since X is fixed point.5 n6 T! T( x1 g9 |( P/ Q
" E2 [* q( [1 N; Sn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ( N2 R6 X1 F' O$ d9 m4 M- h X
1 10 K; e4 ?/ o4 R# N$ J; m4 ?
2 7 3 1 ( X9 \- k. \2 V3 u
3 79 25 7 1
# w3 d7 S: b" `1 B- ?- }( _1 i& p4 1021 253 61 13 1 ! S+ K i5 D Q, v u7 O
5 15621 3121 621 121 21 19 e( W, G, n) V( q$ S+ w
- d2 N/ R6 I1 a2 a$ ~
7 X1 _4 u( m/ Z ]: H# C- B |
|