TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ; P& d5 E1 [- i% V! f/ V
水风 发表于 2014-5-2 01:57 ![]()
& I V* i1 E3 w再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
: y, R, b s4 w. y( f: [0 A* X, v2 m) r
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.$ e0 S: w7 W/ y8 R1 v
& j: H) c9 G3 P) J
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.7 @9 A# r P$ W7 E
: [: H$ i' s( s7 U" n+ U, Y6 rAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
' [/ _ n' z1 W
( w8 \/ a% `$ E7 Z7 {n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X + j) Y( p0 u: U# j5 d* G0 B, ]% i
1 1% g( Z/ b; c' W9 {1 G
2 7 3 1 * x- t2 Z5 m1 K% _& h0 B
3 79 25 7 1 5 F9 x+ M& r5 h- B
4 1021 253 61 13 1 # `/ Q7 c4 M! W( `# A) n4 o% c
5 15621 3121 621 121 21 1/ D5 U0 c% G' V9 w5 @
3 Z7 Z, M$ n4 c" l5 ]9 F5 E0 A) E0 v% T2 T, S
|
|