TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
$ V+ x- N) W1 C8 n' |* L) w水风 发表于 2014-5-2 01:57 1 k+ T1 r% a1 r8 W; T& T
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
: ` u- K* M5 g m! N0 `! j+ d& i7 G9 \/ s9 ]. M1 L( _, D& B: r
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
6 r5 Y/ V& n7 T
" M S* |5 `" B9 w# g$ S# U/ Y+ z1 sThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
9 J' O' | m" ~( U$ b6 I1 x; a6 V) t9 a8 X3 {$ w) h9 @
After being divided (n+1) times, Z becomes 1, since X is fixed point.) k& D1 u2 {% I* \8 d0 d4 y
+ f; u0 Z3 S6 r1 h/ C- F" L/ w
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X . C) N& d E) w" V; b; L
1 1% f. }1 B1 p! } |8 c* p
2 7 3 1
7 Y$ e( e7 L, r5 p3 79 25 7 1
) B7 n6 K; D. ~( l E# o( K4 1021 253 61 13 1 ! V- g9 [. [! Z2 C# ~1 |
5 15621 3121 621 121 21 17 m# z* _ U! l, F
5 ~8 ]. `$ J/ }2 [$ \- c( y( d5 t0 e- ~1 v4 @8 Q
|
|