TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ! P8 X1 I4 l, Q O( q1 d9 u1 I- D
水风 发表于 2014-5-2 01:57 ![]()
/ d$ f/ `& `. Y6 b再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
* r' W3 E4 W* E8 w E9 W, ]+ x% {7 T. c5 @# l2 v
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
4 D0 Y! s6 c' d! l. \2 P# b& [3 c1 I
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
' q( p: A% i' n$ u: K# q5 z3 R; T' |7 S
After being divided (n+1) times, Z becomes 1, since X is fixed point.7 }. _. H7 E0 [$ V+ v& z& @7 W
+ n) k: `8 {) t5 `
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
0 z) s* R% H/ }9 e5 r+ f3 j5 N1 1
2 o0 q( c5 z7 B# F8 X2 7 3 1
7 ~! ^) t, ], V! g3 79 25 7 1 9 x ?# R$ j" K" c( [3 S* j8 m
4 1021 253 61 13 1
0 c1 X: k/ n: I, {8 D5 15621 3121 621 121 21 1- I0 R, V: F) q8 D+ U: s8 x
: v7 b d( _6 {. [+ P0 b- P
! @0 Z: e0 m* i( Y2 V1 V0 x+ e |
|