TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
: Z2 W: y3 L" w$ `6 T7 E0 p I1 ~$ o4 g% ~$ c水风 发表于 2014-5-2 01:57 ![]()
, Q, T, H1 u5 t% ^* S再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
, ?* J& u( r. w( D1 Q2 F. U
5 ~/ G1 H/ v, bfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.+ h2 j! g8 g6 o4 o8 \( X0 }5 ?
, f/ Q6 i! }3 b: p* J
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
+ f4 P& i8 O) I
5 S0 K( I" a" g1 n& q% n: I9 h- ]After being divided (n+1) times, Z becomes 1, since X is fixed point.; ?: I* ]: o- X. y; u+ T$ m
. V' _# J1 I' _5 U, W7 ?n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X % M* V; H( F, C' k
1 1 [* X: _$ g. m9 {6 p
2 7 3 1
- k I3 K+ ^3 ~) D# l3 79 25 7 1
, I- _& e. W) R6 M5 E4 1021 253 61 13 1
9 A! K+ Q( Y/ A! @# Q) Z( @5 15621 3121 621 121 21 1
) g1 {: S. a+ C; Y2 Q* u% `" g. c8 \1 G# P$ f* ]2 t" `! W
5 x( n `& |- `5 e3 Q, |8 i |
|