TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 - f0 M& E# j, b% E1 M1 M) J+ v
水风 发表于 2014-5-2 01:57
! e6 G B1 O+ y; A5 \" s再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
% c- F) u' m4 R/ Z. U( e/ S/ J0 U1 }2 v( O Y; z4 ]! n- T
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
y. M# |; s: e$ ]: L' G; N2 K0 U* L# k6 [
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
* N' _; i* d$ a% l3 s
# _! K" Y1 f3 K& C, nAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
5 I7 ^/ ]+ L) _% F
O# P1 P9 `8 n. g$ Q# {n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 0 I0 P* m+ b/ s' k& J8 A5 L
1 1
4 ^, `. y) Z l0 E" I2 a( d# U2 7 3 1 ' Y3 Y1 ?& j+ p) d' s
3 79 25 7 1
; b$ ]" V5 j! V4 1021 253 61 13 1 8 p/ M! y' }3 {" l' t
5 15621 3121 621 121 21 1
9 L U, {! T z' w5 k- |$ o5 k# c- t6 E1 B4 F0 Q) g' u+ M+ |
, \3 o. W- S- J9 G, E9 H7 v
|
|