TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 / C+ a3 k. d4 C/ n( R/ A9 g
水风 发表于 2014-5-2 01:57 ![]()
" d* X( M/ X& G& a' r& q3 S2 a8 s再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 4 Y' A% Z( N1 Y* T& {, G* Q2 ^* E) Y
! N n" t9 p$ A; g* d: pfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut., p% f& @# \' A+ p, b) j! E0 b
i2 b8 O) s) M _8 y5 @
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times., b! U _" f1 }5 m- b1 `, p$ i
& L0 y; f6 g8 I4 L; q6 ?- X. RAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
9 u0 r2 _) @% x" v5 X5 k7 m- I& Q Z L& |# b- l
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X + h1 ^, R8 ~9 F5 m J3 H7 A
1 1
+ L+ k' U9 N+ q* x( Z# [9 H2 7 3 1 ) l$ x: R. v0 U; j6 J4 {, E
3 79 25 7 1 $ P; Z- r2 ^- o8 i
4 1021 253 61 13 1
/ _8 a: B, y( k6 H1 g r+ X! [5 15621 3121 621 121 21 1" U/ l$ g0 I9 v; D
! G, u& S/ @* [, c1 B7 Y0 {- C# A
! T. E# m/ ]6 E! B, w
|
|