TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
2 t. b+ R1 m% X8 K. b5 X水风 发表于 2014-5-2 01:57 5 ^+ Z; g8 \8 K# h6 `9 z+ k
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... * F9 w- ^9 V) ]' Z% X
& {( G8 W$ n7 k) b c
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
" l' x d4 `2 z, Y; t @/ l# R+ g" u- Q1 \7 s
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
* b& j% j0 c' _, U4 S$ R" l9 ^
' _3 L8 y4 y9 S/ d3 Q# B' I7 |After being divided (n+1) times, Z becomes 1, since X is fixed point.
1 B) `1 l/ }% x9 p
$ `, h4 M$ G* b7 P; ^n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
a- j& H4 h3 h* T/ X1 15 o) f! p! K" ~
2 7 3 1
: j4 }) F! {* \% o- B3 79 25 7 1 . d1 x$ }, Q. l8 F7 L
4 1021 253 61 13 1
! x% P9 K; o$ d' H5 15621 3121 621 121 21 1' k' C; I2 p; S! D
6 m. P) r/ C' }: \+ p9 h: b& k% f
3 @0 t4 A, s8 v) |( n3 C; J! o
|
|