TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 X2 C" J5 p# n! K. T4 Q( D
水风 发表于 2014-5-2 01:57
! k* o1 {; W# ^! v再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
; s/ g; f/ | c! ?8 V( H! p3 t# M! [$ Z% k0 [3 ~7 f7 F5 W ^. A: O
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.6 v" W& i, z, Z9 v# X3 E6 e% H
" U$ p% Y- [' q4 O
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
. M6 [. J! D" K' z( S
; V5 F" e* h+ t) u! jAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
' `4 l4 k/ m+ C8 _) p( x; t9 c }7 e( U! \: [
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
+ Q: G9 o; \( l6 K7 N1 13 L& ^: s) p& O2 \# I
2 7 3 1 , d, X% Y' Y& G/ G3 {3 j
3 79 25 7 1
# A) e2 Z0 |* C# q0 Z$ K; t4 1021 253 61 13 1 " @3 w. L! c( t+ e( ~
5 15621 3121 621 121 21 1( n$ w& h6 j% P- \8 E% C) N
& o6 ~8 ?) Q; k9 R
" p D; X: U0 \5 u6 C1 m. @5 D
|
|