TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ) d" ` W& l" j$ ]/ a; T
水风 发表于 2014-5-2 01:57 6 ?# m5 R1 H8 v# [' J2 H
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
. A7 w6 X% `6 s; U" o
1 h; Y) a6 i$ s+ f: u3 u2 ?fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
; C. {* A6 O( a% K" T' f0 f. x* [* N% e' d( h% E- R) W# Y
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.: J3 o1 z: L. ?; ]$ c
: [0 e3 \& F7 `# Q& B$ B, f. v" Z8 }; }. k
After being divided (n+1) times, Z becomes 1, since X is fixed point.' @$ R0 a. G' U
/ Y2 W' g1 o3 s( E; \5 _
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 9 ~" W/ u! y5 W$ T5 L
1 1
! S0 P @: i# }0 a" V$ X; ]2 7 3 1
, w; t' v- \# K9 j& V! H' ~; P' Y3 79 25 7 1 & g# H, u: A" ?" U7 R- P+ U
4 1021 253 61 13 1 2 n+ P) {3 ]4 N4 j; @; g
5 15621 3121 621 121 21 19 C. N, X/ O! P% M( ~- l
: k% p5 i1 T1 g5 j* l7 f2 R$ L
R% r; I9 Z! u8 ]3 W |
|