TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
" }/ ?) l5 O- H; |2 n水风 发表于 2014-5-2 01:57 ![]()
- b5 A$ x; g& X$ a! w再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
8 j2 s7 `6 ]# O! F6 X$ ]; z2 }! r5 J* v, t$ X9 N) h* B
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.% A7 |+ z5 \& a: U; O
. i5 F/ a8 S4 i/ F+ {The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
6 H6 q$ d" Q c% W* i1 @
& [1 n8 H8 U' K! w' C, iAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
; S4 k% S8 l& {8 t6 R" N; g" d C1 D, T# P$ Z m
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 3 Z& S) A3 P) _
1 1
% D5 I% |- [: ^3 }( F2 7 3 1
; n9 y( [$ O2 k; u {9 o3 79 25 7 1 & @* \9 ]8 x2 s* M
4 1021 253 61 13 1 : v$ f( p5 j( L; S1 }# @0 m
5 15621 3121 621 121 21 1
5 b& u0 I9 p2 H3 K( n+ y+ f2 z5 U" R; {0 s# f* h' ]) v
% M% S A3 B% ~; L |
|