TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
. {- }! H# N- @/ I& Z- q水风 发表于 2014-5-2 01:57 ![]()
9 c2 R4 J) L% P* P再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
) o( b& N/ D$ M; u: J' m' v7 o1 T0 K% U3 a" z! j
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
" }6 G& Y1 ?( n/ h$ y1 w2 W3 w+ I: i$ p. `0 n
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.% V; M/ d5 v- G6 B; Q; C9 n6 \
) W- a& _/ }5 ?! K# }
After being divided (n+1) times, Z becomes 1, since X is fixed point.
# Y# I1 w+ [0 c+ R f! a7 A
6 z' F. H$ m k1 H: t9 O/ J( |: \n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
; i9 y D& N% w& a1 1
) }9 W2 T" @4 E9 }2 7 3 1 / Q8 F* R+ f* A; T6 S* {
3 79 25 7 1 4 G% q, m9 l- r9 d
4 1021 253 61 13 1 : {, P4 }/ b3 {* H
5 15621 3121 621 121 21 1" S" Q: K9 [9 v5 R% Z2 C) P$ R
& |5 Z7 F, _- }2 d9 R% r8 V5 F: _5 O& ] `
|
|