TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 / d% a9 p0 P# {/ p2 R# p
水风 发表于 2014-5-2 01:57 4 G3 N! P- Y1 W: r2 o4 \- L
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
/ Y, b$ F3 t$ {, t5 B* N
9 w: u7 Y* N. Pfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
: t1 r( v( p' v
$ o* l( k" X7 }5 G4 q! V9 PThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.. g+ b& Z9 u, t; u: H
# Z4 F/ N/ v9 t' Q# x9 g) k' C$ yAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
, F! ]' }# p9 J) T, S4 J' H$ S
' H5 u; S6 R: ]! ?: Kn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
. s! o; T, ]9 s! w, t2 d2 P3 O \1 1: l$ o3 B6 z1 |- @" U
2 7 3 1 : B3 T: G: J/ `7 X( ]7 u( z
3 79 25 7 1
7 a) O7 h# c3 g" q) C9 E4 1021 253 61 13 1 , ]8 u2 }$ O8 `* p1 O7 u
5 15621 3121 621 121 21 12 t; d, ` `. N+ t8 t
$ {7 C2 \0 M' x( P. P6 q9 @
; {2 o' v" Y$ e8 M! e- |& l |
|