TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 * b1 r, y( s; m9 t
水风 发表于 2014-5-2 01:57
7 b& R p4 i( a$ A( w再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
% S# U. p6 l! _: P" B$ I' f; m0 g5 i
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut." d0 g* Y" i6 i4 U( h
' S3 \. ~5 `" `! z6 x$ fThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
6 }, f; {8 r1 ^& j4 g+ n0 S5 a/ D' I5 ?- ^' \6 r
After being divided (n+1) times, Z becomes 1, since X is fixed point.9 e7 u) Q) E @6 O5 a7 e' r
9 W0 e5 F+ E/ E0 ~/ o9 s. d/ e) I
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
) y+ Y% M- Z; v! _& N8 ?( E* d1 1! E# @6 P: j) }: Y
2 7 3 1
# m' w8 e1 f: A: `4 C; P3 79 25 7 1 # t4 ?( m; u$ b* E6 f
4 1021 253 61 13 1 % T! i& d1 e, S5 {/ X
5 15621 3121 621 121 21 1
7 b; `5 E( `5 G% \8 R
- L( o8 G0 k' `* V' R0 w1 ~
* \9 e! G: I0 R8 m( y9 h# V |
|