TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 0 B N* |4 Z8 ^- k: @4 L m }
水风 发表于 2014-5-2 01:57 , H4 \' S& M% j: x
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... % X$ v" K7 W4 R" _/ D
6 F% q+ R3 ]& `1 j! v# e( A$ A
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.5 B* J4 T) W* x; `! m
4 v9 L% |4 c5 Z8 _
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.2 s2 k0 G8 X. U* H
3 P# q6 i: B- n% R4 |
After being divided (n+1) times, Z becomes 1, since X is fixed point.- V! B* p0 I7 {" K
! l3 h2 f% { L, }& v: u- Q
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 2 p: B, \: X: E
1 1
! T2 W0 c/ c: z t2 7 3 1
1 P+ x' S3 u0 E! |3 79 25 7 1
% P( F" K7 R- p# P4 1021 253 61 13 1 / n5 y& u4 c6 {* k6 R% L% v7 T
5 15621 3121 621 121 21 1
* P0 |2 f( G" l( Q8 V$ V- m2 z! x3 E. x+ Q
5 U! Z3 d, O6 @. R9 Z8 k |
|