TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 8 L1 ~5 M6 x% X& Y
水风 发表于 2014-5-2 01:57 ( E. X- ~, R: ^: [" S& M& X
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
% n0 } Q% ~5 m8 L2 F$ u. x) F3 w! Z& z- f" @! l. b, P7 q1 ~ f3 Z# x
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.; Z8 D- f2 O3 C0 U. ?
. t; r) w# X8 `9 k H1 M
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
8 g& z2 M9 `" B" i' z/ n: b" M; r9 X8 B
After being divided (n+1) times, Z becomes 1, since X is fixed point.6 J$ L S- i) R, b& P
' }9 S0 ~6 A4 P) i5 V
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
0 h$ |, Y9 {% u7 |$ i1 1) a2 ?% b5 g( t- N6 j
2 7 3 1 . C1 P- \1 K3 Z7 V4 @
3 79 25 7 1 , b5 \9 E8 Y2 ~- S# x, D! {, N
4 1021 253 61 13 1
; }9 r6 y5 m1 y- y4 P5 15621 3121 621 121 21 1
" f$ s+ O, p2 [! o# e q: B: z) g. d7 B# {
: _0 { q( K9 A# k" {
|
|