TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 + `8 U% ]6 p6 j/ P: C2 F* F
水风 发表于 2014-5-2 01:57 ![]()
% K1 F' D& q0 y# d再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
; f" _2 z# M# J0 ~
: F# c' g! U4 z9 hfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.8 @: P _% L0 M9 j* w1 [: P: S+ C0 C
( d% D& {7 d& O6 ~; |4 xThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
1 v) w8 a0 g) d( k* @
1 B9 Q j4 X4 T. S/ Z3 NAfter being divided (n+1) times, Z becomes 1, since X is fixed point.' C6 M- W O& }( T5 P( Q- N
5 J/ O( {! N! F" ]: n- ]n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
% N/ ?( |+ m* J1 1
/ Z, ~: i7 _$ O# G% L9 {2 7 3 1
r* V) b' }( }4 I" T& c3 79 25 7 1
. y0 `7 W# t1 F: L$ i3 j4 1021 253 61 13 1 ; Q6 R, j9 v+ ^$ `$ R" k. i6 i- O
5 15621 3121 621 121 21 1; F% o' `8 P$ m" K. B
. `! y a0 ^0 ], C9 Y
2 c( a9 O2 i7 u/ [ A* u4 R
|
|