TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 + A7 T1 O/ x0 y3 Z' Z
水风 发表于 2014-5-2 01:57
) ]! N7 z8 v4 x; l8 O9 r. C再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
3 ^" G; e' ]4 n" E/ K, b8 q
# {, e% d( L' l# kfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
5 O" _- E1 E# I8 R/ a6 N, J. ?/ ^
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.5 j7 ^8 b$ ~" `) p; t- T
" A+ I9 b- ^% q/ S6 A" V8 |- L
After being divided (n+1) times, Z becomes 1, since X is fixed point.% L1 y+ k# ~; ]& e* ~6 q8 w" F4 h
' \* t5 ?! [$ l$ [5 l+ M3 `n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ) \4 P1 Q3 L7 O9 O9 _7 ~7 k
1 1% Z+ p+ ]% C' b$ p" C, s
2 7 3 1 + y4 M8 ]: w; m2 e
3 79 25 7 1 1 \& Y- k3 T6 Q- d$ _& m3 h) [( _
4 1021 253 61 13 1 % o( C3 D- m0 t' M O
5 15621 3121 621 121 21 1; e7 L* w7 n# i* e6 l/ n6 \2 w# N
. h. w+ `0 n2 W* A
\3 w- Q4 E( a/ G) {: L* L |
|