TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
+ ~+ I! R' f# v水风 发表于 2014-5-2 01:57 ![]()
6 m8 ] E- d% l- M8 R7 z" E E再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
- m( r( f3 r9 r% {, i4 B$ _$ Y7 O' X5 h, {- X8 ^0 T! y
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.3 I2 N* d1 M' a
+ d) a3 Q; ?8 V4 a/ DThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.8 Q y* L- w# T0 {0 W& S* I
/ [: N1 g; y, i0 v
After being divided (n+1) times, Z becomes 1, since X is fixed point.& X+ H8 }8 Y+ Q: k- w+ K" R/ c
) ~1 m" X6 ?$ Hn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ' t) o6 x" O$ _8 A) t0 k
1 1
5 K' y+ s, X0 d' m2 _) F2 7 3 1
% U+ c1 v6 b( i0 u/ ~ M1 |3 79 25 7 1
9 C7 Y( I) c1 U: K; Z/ I1 f- c4 1021 253 61 13 1 7 x" L N5 ]7 _5 B* q3 x* S" @1 M
5 15621 3121 621 121 21 1
. G$ x- t" K$ Z- F! k# W& F
) r( @9 X( A* V
' R7 i# x1 U+ m |
|