TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 9 a' s1 J1 q* [! }
水风 发表于 2014-5-2 01:57 3 S6 I+ V% B; I5 g% w- E7 ~( `
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
) }1 n' o0 ~* ^0 A1 M
' x7 j& G7 u% G! d7 K3 efixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
# F# |9 R& A3 ^& ], A6 j
h9 @' V2 i+ b% C0 VThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.- h8 l( s) [' x5 h% z! W+ d
1 p) o' _2 {, E8 p' ?- v
After being divided (n+1) times, Z becomes 1, since X is fixed point.. i F, T7 z) s# d' i) G
' N# i7 y/ }* M% q, v6 y
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 0 k, p; l( G: O$ |4 ]
1 1" L4 f+ m4 R% q8 c2 Y
2 7 3 1 % z0 r' z2 @4 ^/ l5 E1 Z
3 79 25 7 1 , p" z& ]* {' Q8 D, Q
4 1021 253 61 13 1
0 ]2 u6 j' l; T) a) z6 p% r* s, }6 j5 15621 3121 621 121 21 1
4 C. n, `, T) Y, Z. R( j& X$ S+ ?! [
d c' z* ]& ?$ f |
|