TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 - [3 a3 Y, x3 z# g- B. h& v
水风 发表于 2014-5-2 01:57 + S1 {/ z/ \% \1 u; y
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 9 u/ N, n( }% X C, ?9 y
2 ~) h( n ?: O/ P, q( K
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.1 i4 G3 P4 A( Z+ o g" V' M2 Q! \! I
' M- t7 F- k v7 h$ Q" k) KThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
4 q0 S7 N1 J5 n9 O" j) A
* I+ o; |( u2 u. ?+ o) DAfter being divided (n+1) times, Z becomes 1, since X is fixed point.; Y' z2 K) L- L
! n$ C5 D5 n5 c1 t6 D0 i+ \6 A
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
& F8 }+ Q: d, d1 1
" ^% Q9 \5 o: B& ^8 T9 y6 I+ A2 7 3 1 * i! f& \1 y# O. M* ?9 Q; e0 q
3 79 25 7 1
% Y- r5 {6 M! D* f8 n7 O6 U* v7 F* \4 1021 253 61 13 1
% U9 j' m+ Y6 Z$ e( l& k5 15621 3121 621 121 21 1
& d' w' y3 a3 B
. s, M" h( r7 ] s$ A V3 q. m
3 G0 i# {5 r: p# Z2 ?0 |9 i, T |
|