TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
% a& G0 O9 v; e( H1 c7 k水风 发表于 2014-5-2 01:57 : [$ u J0 i& n. Q4 O$ h' ?" k
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
( c( n- _, H m# m+ B2 n3 j
4 Q" K, e: ~# R+ Y/ F, ifixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
2 g$ z7 ]3 P. A7 Q- L7 T
! x% _ z8 M3 c2 S4 Q% QThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.+ Q! ]2 l6 }+ @- h) v0 l
$ k+ Z8 H* ^( u/ D/ s0 U; P `. y; FAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
. H0 q# o a# |9 k' G* I9 K, I) F' [) ?# I8 N) e
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 8 d, l& z' p) p( m% P+ q) v/ W* n
1 1! X3 W# b- e, ]( N6 C
2 7 3 1 3 m' g# x8 n9 y5 p8 U7 S
3 79 25 7 1
5 c- o3 S: [2 h! @4 1021 253 61 13 1 ) O! g1 m; a+ B8 O3 e( c
5 15621 3121 621 121 21 16 J2 s8 ?7 D2 M, S) t
* y& a" N G- w3 @
1 i. c T/ N) v! {. f |
|