TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
6 ~$ z$ D7 Z1 u9 V7 |' Q水风 发表于 2014-5-2 01:57 ![]()
2 v8 _$ |' Q$ t6 P2 N6 h再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... $ Y2 j8 a( _" q, h
1 H* ]6 @. C1 c' }) }! P
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
. B) F9 r# A1 _3 D1 {% T' _& z* A, x) _+ J0 ^& h1 R( S
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
- |! G6 ]" l' d- U$ E# _; N' f: i8 P7 |+ x1 k ^
After being divided (n+1) times, Z becomes 1, since X is fixed point.
" E% \3 ]: _: y6 I4 H
/ H4 }0 k/ Z1 w8 mn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 7 B# O8 e, {! ^# L% [
1 1
' M$ L7 t1 Y* ~3 ~0 ?) \* V4 F2 7 3 1 - U% S1 J, G2 e+ L8 ~1 M
3 79 25 7 1
6 S. |6 _3 j z* `+ L E G4 1021 253 61 13 1 6 F8 |) A$ }6 g+ {4 U. e
5 15621 3121 621 121 21 1; C# q% \6 u# p9 F& X
5 |- G! Z7 m6 }4 t) h, i% o9 g j
|
|