TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
: U: m {/ A S/ m! z' D水风 发表于 2014-5-2 01:57
& L+ u. C5 H6 E1 R# A* W+ D' Z; {再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
/ |) c# X1 F3 z: L6 {$ [! p; k5 F2 R7 O( ~1 X0 f
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.2 ? L; P8 F/ }; @9 c# o, Z
& }$ |1 ]/ w( c( xThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.4 b" k! y+ Y) @4 o3 o9 d8 U1 R
0 Y v0 A. [1 Y& I& U
After being divided (n+1) times, Z becomes 1, since X is fixed point.$ }3 C3 T3 L* s3 l$ s2 ?
6 j) x2 f( D# X0 c* |- ~
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
& ?% G! P. u5 Z; k- r& S5 X1 1
) P0 `/ J n. _' V' b. L2 7 3 1
- ]" I6 s# ?9 b' \* _ C$ `3 79 25 7 1 " d$ v4 v5 C+ [+ q% K% s/ w# F
4 1021 253 61 13 1 : k7 k7 q Y/ @& D( K" X/ A
5 15621 3121 621 121 21 1
; V0 V, _; R8 g2 b& O" W0 W, ?5 G5 Q$ U5 G
4 m1 J% f! q$ v6 Q& E; F4 E# c% N |
|