TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 5 d% i d1 j8 C
水风 发表于 2014-5-2 01:57 4 n# N6 Q) H- D1 s2 N' q( M: h
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 4 h1 z$ B; z/ b! [- K5 `
; t4 a2 i8 j' n/ ffixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
, S4 e% _% G& x; h8 I, d( l' Z% ~; Q! b c/ l
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
8 W' P |0 z' o1 _! j1 k$ y, a3 `7 Q
After being divided (n+1) times, Z becomes 1, since X is fixed point.; X% a' s7 L( d& d z
# Y' I/ ]+ v- G5 @0 ]+ n
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ; L9 i7 G2 f8 D! M5 Y0 S
1 1
' X. g: J! b: N- a1 m2 7 3 1
, t2 b, x) L! j3 79 25 7 1 3 Z4 J6 K4 T% t3 q- z, }- `
4 1021 253 61 13 1 s6 O) `% Q: s) T; D+ O7 O
5 15621 3121 621 121 21 10 V6 z$ e5 q2 k: w7 b6 n
; ]7 ?, v( h, G$ k8 Z# T
7 G- u, V5 E" Y" A' C5 c |
|