TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
( j. u/ c$ r8 G- R7 M& v) ^1 K水风 发表于 2014-5-2 01:57 q; f7 Y# f6 n1 k9 F, g5 x3 Z8 J9 G! u
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
! W/ s+ w5 u& o' \) M
6 S: {- K e) R6 Vfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.1 n( E8 r; N" T N9 y0 p8 A
. {3 Q! F; D. G, q" k. J
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
* p% d# v( G( `0 e" n3 Z0 @9 [7 X4 N1 o, A) n" c0 a
After being divided (n+1) times, Z becomes 1, since X is fixed point.- r* A% s# j5 m) u2 D3 p! r
7 c! V; j" A: N4 R, U6 U
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
2 R) q8 k3 v0 h$ K& N9 {# Y, l1 1& s3 I0 k5 `% E+ n
2 7 3 1 ! U5 M1 ~+ c! @* Y7 m4 `
3 79 25 7 1 , u x- d6 I: M3 p( d% |+ w; N1 e) K
4 1021 253 61 13 1
2 R4 X; R2 O/ a3 ]6 C' X2 v2 S5 15621 3121 621 121 21 1: A+ j3 B, L' q/ b2 G
# ]2 y7 a% s+ g" v
9 e3 S- T7 \+ T4 l5 K1 M |
|