TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
" V& |3 P' k) W4 B6 C' Z) h水风 发表于 2014-5-2 01:57 ![]()
, p$ U& `1 u4 A$ h; w0 h再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
8 D2 n3 A* a V" _) F" K4 q# U1 V* b# ?2 B- Z
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut." X/ e: T- _) W& S5 R
' @ C6 V6 Q/ Y. S
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.1 D; ~. L2 L, G6 {8 R4 O
0 d5 a3 W, X/ T/ `2 c' ]
After being divided (n+1) times, Z becomes 1, since X is fixed point.* g1 H v* K! P& u6 m
; U1 ?1 R6 E# f$ s/ a9 h+ x
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
$ M# O- G5 Z, Y$ \7 E& u1 1
/ j" b: b; G% E+ q) R2 7 3 1
9 N6 p( K( v( A/ F( n3 79 25 7 1 7 |0 E' _$ M; r4 O- k/ r$ D$ H( |$ w
4 1021 253 61 13 1 1 K1 _$ R$ p; d* y( y
5 15621 3121 621 121 21 1
* d }/ T- f& s: ?3 D8 A# g" ?8 K3 S( m2 z! B3 J: g& _/ [, K
4 Q: z; V \' o, s' k
|
|