TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 1 E. p- g F) z( f% I' K) o
水风 发表于 2014-5-2 01:57 ![]()
2 [! `! E" G3 l4 f+ [再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 8 \0 ?1 j6 |/ B0 s# p
9 F! A2 z5 _7 }' s6 Gfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
5 \) {6 ?- s/ b7 {! m6 e8 c
$ g2 N) T% p' N" D7 P( _The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.+ L5 z; G1 X7 I* O6 n9 Y/ c
6 N4 z7 \; n+ L0 d
After being divided (n+1) times, Z becomes 1, since X is fixed point.
2 h S: S% O, [ {0 g: S3 x- T. V" u7 y0 e
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 4 ?7 `- N+ }9 R) V# P* W
1 1
8 T& _) G% v3 L. F" G3 z2 7 3 1 ! l9 D9 f% S5 q0 |* q# j! w
3 79 25 7 1
; b6 o& a. h9 {* Z$ W4 1021 253 61 13 1 c" \1 c/ O/ O2 u( Y
5 15621 3121 621 121 21 1
! E) @' I2 g; R# {0 p8 P6 B
+ v8 C; p9 h1 x7 h# x" `8 C, `/ u! a
|
|