TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
& E5 e5 V2 }) ]9 ?水风 发表于 2014-5-2 01:57 ![]()
; A& ~, Y+ |( `* O. M再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
0 p( f) B* i( U7 E3 O7 U) c/ S0 e
" h$ [& y( p9 D; r/ K2 Qfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
' s2 N% p* M q4 _, N
- X& f) j+ C0 c5 M0 ]The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.# l. V# m( i0 H8 j3 r1 Z
% ^) I* F; }& Z3 bAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
! m; U# p% h# Z& E
" `* y# B0 K/ x: N L; c0 kn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ! J, Z! a% }; D
1 13 w6 }: L* g$ Z7 H" M5 Y. c8 Z
2 7 3 1
5 U! t; A( `% Z; z3 B" g3 79 25 7 1
7 R9 Z% l- Y* Z7 r& L4 1021 253 61 13 1 7 E2 T/ w* A- v1 [1 @
5 15621 3121 621 121 21 17 f2 C6 p+ L7 J; P
0 q A7 u; R4 ]! q4 y
" I0 r* Q3 i0 y8 W" e |
|