TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
$ Z2 |9 {& W7 J# h- H4 R* ?3 C水风 发表于 2014-5-2 01:57 ![]()
' b% P# d( y4 h再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 9 \9 z4 y; Y% s! g/ E
" Z, \/ j% B6 D' z% M! c& H/ `$ `
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
; [# a7 R+ U# O1 m9 M0 `$ s& z$ z" x7 S* {& n4 E% \5 V i# [# |9 a
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.3 P7 H7 R- X" F# y' z
2 u) I: M# q: K) a7 m
After being divided (n+1) times, Z becomes 1, since X is fixed point.
$ w" r" t$ \2 U+ ^# Q. h6 `4 J( i" Q3 y% \# V
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 1 M& f+ l. l9 S( J- Y
1 1 o2 P# _9 o9 c
2 7 3 1 * W8 m. ]1 P' @6 y3 [7 q
3 79 25 7 1
& i0 |! N2 ~/ @- [. y6 c; k4 1021 253 61 13 1
_, Q! Z1 @: b! a* F+ O5 O5 F5 15621 3121 621 121 21 1
4 q% h5 t: r, }+ K1 \% Q5 P
, x0 v J) _6 @$ w! N' o0 P
9 T ^0 B( E, `' [0 G7 o* r; C |
|