TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 . K3 p u# m$ H- O8 c) d
水风 发表于 2014-5-2 01:57 ![]()
( \) W/ c: d) m/ a$ C再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
4 j4 g7 D/ F+ f; [
/ p6 t6 b$ ]2 g8 ?* q* v& bfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
4 u/ H& `: I$ P) P- d; f; r" V+ Y( l7 D
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.; c7 O3 `) Q! p) Q# a8 g
C& e$ @& u x& v7 k) U8 sAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
. l: L7 b3 X$ `. ]2 B* W3 c( {1 Y6 q: v- a- Z; H0 c: q+ t
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
. ?0 j5 ^: m& R! a# `% d: e1 1) N* j( e1 j- A8 f' n8 |7 K" L
2 7 3 1
, D3 m, D8 `, a0 G& A# k F: ~- D7 y- ?3 79 25 7 1 4 n4 h* @7 _# m, L% Q
4 1021 253 61 13 1
8 l( b+ e+ h3 ~! c2 v* k/ F5 15621 3121 621 121 21 1
. l. ^7 X3 u' a. r
0 _( |* m) A4 s) i0 H. k& R
7 Q% ~1 E* r, l# b+ c% G$ u' ~" T5 k! ? |
|