TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 0 _1 j# W; A L( N
水风 发表于 2014-5-2 01:57 ![]()
# `8 j$ }5 V% @( Q4 w5 Q再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
' t+ u: s: }: W+ `9 \ ~. H6 g: }. {3 @1 x8 N$ ~
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
6 G8 K2 i" H# }; }( u! W* }( ?9 `6 R- m+ Z
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
6 Q% {; i. b1 k$ n8 j
* T* ~7 ^3 [; r8 _2 `, CAfter being divided (n+1) times, Z becomes 1, since X is fixed point.% H( o$ ^' `8 ^2 z% _2 H) l! g
" y1 ]* R. g; E7 s7 n& \$ |n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
% ^6 W; d. C8 P1 g* ?4 K1 1
: F" h0 D7 q! j: m2 7 3 1 * w1 W! q7 D, `3 [& C6 U4 E- E
3 79 25 7 1
5 Z( W: A0 t' a/ k% A* O. q4 1021 253 61 13 1
; y) P$ @8 c% z+ d5 15621 3121 621 121 21 1
, }0 N9 M5 G# q% ?4 }8 X1 X% a& A" G
8 x( K" s1 p# L9 N8 w
|
|