TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
6 O. l8 F3 _0 o0 v水风 发表于 2014-5-2 01:57 ![]()
' O3 V- _9 e9 \2 V再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... & J4 p* b* d# t6 P+ f1 p
! ^1 K' ]* m( I. K, X5 ^- `, K% tfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.7 i2 M8 I7 M- [
$ d. M1 D! l5 g% L, i' E! m& BThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
6 u7 M- X2 }5 P- A5 t1 u
E1 A, n# O/ f9 [2 Y) h9 ZAfter being divided (n+1) times, Z becomes 1, since X is fixed point.: o9 K1 h5 K. K) E
: G# U# V& ^: i$ n/ Q
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
8 q* z: G% q1 |/ _6 v1 1
* G9 H- l: H( |5 y( O2 7 3 1
) x# J- [$ l! v' e3 79 25 7 1
. j& @; O3 v0 V4 1021 253 61 13 1
2 F; ~( b) }1 i' b, ^1 w& Z& \5 15621 3121 621 121 21 1$ {: ?# y' M1 c( R/ e- \5 q) o" S
! ?; n2 \# o, ?# @0 Q) q' Z0 r9 a& k
( d! R0 i r' r. x8 \* R |
|