TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
. U- e# ^, k/ q' a b }5 t$ I) N4 P水风 发表于 2014-5-2 01:57 / K: X8 @/ H4 M: T
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
. \- k0 L8 S6 b* r' z+ i" ~- |0 Z: L! w: f; X3 Z
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
' K( U( G# ]+ ]0 Y. b* G3 [+ X v* _
5 h/ p0 c, l; \# B, JThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
1 C1 B8 z8 ] P/ l; F( r( p, ?3 E: o+ s; v$ K- O
After being divided (n+1) times, Z becomes 1, since X is fixed point.
# b+ \* m' ?3 s6 V W. @6 i4 b. V+ n! y2 l7 {' Y
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
! Q% Y* n4 j9 U/ }* i' v; q% V1 1( g2 L1 [, R X+ n5 T' q" D, ^- U. s9 \
2 7 3 1
" D, s. M! c( ~6 a( E3 79 25 7 1 , A, {; P- F7 v
4 1021 253 61 13 1
; f7 L5 b# N, l1 v/ Q5 15621 3121 621 121 21 1& I [& e2 V' C. x& ~
; B& K. j7 i. a9 h8 n
. B8 Y* ?, n+ g% ~1 h; U
|
|