TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
' C% o% U/ O) C$ k7 s; B水风 发表于 2014-5-2 01:57 3 U) T6 s/ x4 I; a' i3 N+ p1 M$ P& F
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
0 A/ J7 J. l8 s" e* r5 U% j+ n+ L" q; b' e2 }! X
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
1 v8 F5 C. N; w1 ]( k3 b. Z o8 g! s( P9 M" T
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.3 d) Y' T& W" Z
* [( K2 T# ^' P G+ F, D- H
After being divided (n+1) times, Z becomes 1, since X is fixed point.5 c4 z6 w& i$ A; f% P
0 l! n+ u0 D9 Q& J9 ?! nn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X : Z P$ U+ t9 p" E
1 1
3 u/ j+ ]* j z) F- U& n/ } D2 7 3 1 + a: m1 q4 ]5 ^
3 79 25 7 1 , _" k0 u9 H% k ], h( E
4 1021 253 61 13 1
. e' y& x5 J$ i9 Q/ k+ W2 j. x5 15621 3121 621 121 21 1
1 _0 J v1 E( V0 u6 P4 Q* C) ^
, g3 K0 Z. h1 S! T, A& L) m4 I( k# [$ Q. e; d
|
|