TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
$ d" \& n. ]5 ?) v6 U水风 发表于 2014-5-2 01:57 ![]()
9 W1 ^: y% F. F* C/ l+ A再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... ' ~, P4 {$ c2 `, Q
8 t4 I- C. h" I. l( a) b) @
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.4 M) N6 T, a# Q" p6 ~0 g
6 M. ]8 s1 p" W/ o) N$ c/ _% r$ q/ I7 k
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
/ y* `5 R# ~0 h( j# X$ E1 ^- Q; i- r3 F: [
After being divided (n+1) times, Z becomes 1, since X is fixed point.
0 r/ J& i' B+ r/ H* s9 C; m% X7 \& ~- y! |! m( Q( _/ r
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 6 k/ o! x$ L* d1 Q
1 1# G3 m! l9 w# C+ ~; L
2 7 3 1
. P* b" R# E# i/ @( v b3 79 25 7 1 , X, ?$ x0 j& H3 ~: C t5 X X8 v
4 1021 253 61 13 1 ! p3 S G2 c2 p6 P
5 15621 3121 621 121 21 1( W3 ]9 O2 H u9 V1 B
M7 J% L: |$ |8 a: W
% x+ V% m) P* Y( U3 i. ] |
|