TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
, u% L+ G# b* X1 \水风 发表于 2014-5-2 01:57 ![]()
* K# [8 O) d; _/ g( d) U再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... - B0 P4 `" p/ P: c
! e7 D. Q/ f6 ~) c4 Hfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
, `2 s1 J7 Y+ X# D. q$ u5 }" I2 B. h& E4 O2 u: C
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times., D8 n- o$ l) Z0 W& [2 a& s9 [
+ ~9 c; B# h" D0 c4 x) [5 w; WAfter being divided (n+1) times, Z becomes 1, since X is fixed point.. k! x# r( {4 x; T0 M4 \3 h; e9 i' `6 Z
+ g4 L) b6 E* Q% j
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
# ~$ u$ C7 L; |# B1 1
, ]5 ?$ q! q: [- H% L2 7 3 1 1 R) n. l0 V+ G7 Y
3 79 25 7 1 6 @; E& o% Y% p8 o6 }
4 1021 253 61 13 1
* p' A" D$ a4 k. o5 15621 3121 621 121 21 1
9 f. B( n( T, h9 F: [8 G& d5 I- X7 m8 O4 Q! a3 P# O
9 V8 L# E5 E5 G |
|