TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 3 o6 d' L( W q3 j: v6 e6 e
水风 发表于 2014-5-2 01:57 ![]()
% f( q3 ]' |. J0 ], T7 o再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... # w9 k/ ]0 j% p" k) L
$ h( X/ @" Z7 |" S6 j0 U# ^fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.' s9 p4 ]$ k2 p' ?
. f D4 J8 ?& }# h* p
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.1 a. g: F. o- l. J ?9 c% g1 p
4 P% ]8 f+ Q, o2 K8 R; m' z2 q
After being divided (n+1) times, Z becomes 1, since X is fixed point.# R7 ?, b/ w0 h! |
( @% z8 e! H4 d2 J
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
' ]! F, x/ @% A2 p5 J0 W8 Q1 1
7 [/ R, D8 d) N2 7 3 1
& t t: ^0 b* g; z3 c( R3 79 25 7 1
* T @/ z- l7 x0 P6 }$ y% l% `4 1021 253 61 13 1
8 X& v ^6 A- W/ |" S2 _/ E5 15621 3121 621 121 21 1
: q0 U, l; S. X+ z$ k; R( x1 m/ p, p0 W V# F+ B
6 g4 \1 X6 o5 ?! q |
|