TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 / ^+ h4 k7 b5 \, x* V8 [
水风 发表于 2014-5-2 01:57 ![]()
@! T! s/ M7 O& E6 O再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... - c y) q# `9 z. B$ w
5 v9 u( C; b5 A3 L/ G) c$ u7 f
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
" Y3 r8 O5 L1 s+ D, J8 \8 {
$ t1 J0 v: V$ o+ W$ \0 n+ D# {The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
o' \. w2 i) E) S8 p5 x
+ I" o5 Y- g1 N2 ?After being divided (n+1) times, Z becomes 1, since X is fixed point.
6 _4 e- Q$ ~: c3 _/ ]
. _' m/ d# [% P* t4 F5 Gn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
+ U$ C5 c6 Y7 Q1 1
& s3 p; h+ [( y% ]; n7 G: ^" p2 7 3 1 4 M3 |( ~$ H/ L
3 79 25 7 1 ! w1 `; b7 M' P
4 1021 253 61 13 1 # ^& F* F& G% L U8 c8 s k
5 15621 3121 621 121 21 1
v$ T1 m( L. |4 p+ f
" Z% a$ R2 b$ S7 L6 t5 B& U- r! E& D+ C6 w' W7 Y( k
|
|