TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ! [9 B" I. S9 s$ i3 g
水风 发表于 2014-5-2 01:57 ) o- x3 C/ n! r+ f/ V" g2 L
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ( D; F) Y4 G- K7 m3 P4 W4 |/ e( p4 Q8 ?
' H! e8 O! E; L/ N0 Gfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
+ p' {) b% B; \* k" a' Z2 R M0 b
4 r4 S+ e9 Z5 W/ x4 `2 W; h, d/ u& dThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
: N6 l: d5 Y/ G
4 O8 W7 n! A! C- y& L& RAfter being divided (n+1) times, Z becomes 1, since X is fixed point.7 {7 z. z" Z: g( X$ ~
4 {7 j7 v$ Z4 Y8 d
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
/ \3 n5 W8 C, j% X, V1 1
! ^( M6 @" m i8 w2 [* a; s2 7 3 1
, M9 { \8 B9 ?/ D& i Z" q9 ~7 f' t3 79 25 7 1 6 H0 u" ?* t8 j8 m( C
4 1021 253 61 13 1
! D! Q+ z3 @% v$ n) b3 c5 15621 3121 621 121 21 15 w6 ?1 `2 r1 Z
' Q; W7 {5 y/ R3 n+ Y' w
, {# W, }, H @+ [( j" }/ K% Y& ^ |
|