TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 Y" y. q5 i2 E' `; d
水风 发表于 2014-5-2 01:57 ![]()
" h- r5 C- z/ k/ l1 r/ y再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
! J! l; B4 {! r* D$ Y. A" D' }) U* ], P6 `4 n
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.( A0 ~, Q' [$ c# L" X1 l& o
2 q9 o. }7 K( O+ ~! jThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.1 \: P3 X% H$ X o
( T/ I) g5 L0 C, lAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
" G. e* C# j6 f. K
2 q, v% Y" g1 |5 k) y* N& {- X5 `2 l1 ~. ?n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
7 ~) y4 B2 ]! X. }! ]2 z! X5 p1 14 z; _, K' x w& l0 ^7 T. [
2 7 3 1 5 a. e3 B# [1 f1 l
3 79 25 7 1
' ~( B' u$ W P4 1021 253 61 13 1
. w. _7 @/ [6 x5 15621 3121 621 121 21 1
% m0 n3 O6 \' Y2 D1 y
, f g- D) s, h0 o3 k
+ }3 Z, V; V* ^$ l |
|