TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
1 O% R& X: E1 Y& V水风 发表于 2014-5-2 01:57 ; E7 d0 n A6 u7 Z9 T, T
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
& C% O1 @1 K3 W/ ^( |! T/ b
+ e5 V1 k- U, ]$ vfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.1 _& W6 n6 b% a6 |
& f8 q9 f' ^8 ?$ ]3 m; U4 e) J# K
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.+ f" A; B# @5 v0 k/ v$ e
1 [. t7 E2 u# N O2 A
After being divided (n+1) times, Z becomes 1, since X is fixed point.& F8 x$ y3 H8 Y. i
: B: e: d8 k$ ^& C) b5 |, g
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
, d' a) `& `. J1 r- `1 1
+ I8 B) ^; C9 |9 t6 J3 u+ d) r8 N2 7 3 1
& B! Z5 Q1 l) J3 79 25 7 1
9 M6 K6 ~- p6 V: u4 1021 253 61 13 1
6 q" Z/ U& R" f* E |$ k2 f6 I3 X5 15621 3121 621 121 21 1% i6 G0 L3 T% C: b% B$ M
- R9 G& N( ^6 [: u. Y6 F1 o7 m) }% Q1 B: D" b0 ^
|
|