TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 - S& Z3 Q) W9 B7 _6 i; c# X
水风 发表于 2014-5-2 01:57 # K7 \8 f% [& m+ D; C/ t" s
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
3 y% Y y$ O7 B: Q p
/ C, E) i* z8 n) nfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.' x5 s8 y* t: w( N. C2 f
3 F) _" R+ Y3 b3 y8 NThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.+ ]2 [8 N' i! E9 k( F5 B$ z: G
6 ?9 ?4 J; `! e7 L; a7 gAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
8 F8 u: S4 y) }, {% | K, i( ~" w6 m. a8 a. h
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
+ l i9 |6 {. y3 U& b1 T1 1: M3 i! O, K: P, \. _7 D6 N2 `
2 7 3 1
9 Y4 y% w* p* b& C0 ?6 H3 79 25 7 1 4 _" K) c5 U* K9 T
4 1021 253 61 13 1
2 d5 R" ^. T% m- l* k" s5 15621 3121 621 121 21 1" P9 Z% j# v m& x- U
4 F# C6 N5 Z9 p9 v3 S. }$ h
& e; o! [0 f- B/ L6 o
|
|