TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 8 u! r; T$ L M$ T+ P5 p2 G
水风 发表于 2014-5-2 01:57 ![]()
% w7 q" ^ I; ?再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
t6 Z$ {' H8 }# r8 j) d! N8 @
/ m) M% d# G9 a: p; |5 }) V* Z xfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.8 R8 R: V* b1 w2 ^9 M
, |2 E4 s' X) f$ ]The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.. Z5 U5 F" O/ \! Y S+ G6 [) l: E
. t w# B) c7 U6 MAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
- y# [4 Y" ?1 ~4 |+ V
) `3 L4 V3 n9 E8 s2 X6 a; Cn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
8 c0 B v5 _- U1 q" c5 n1 1
: d3 s/ r0 u9 s7 O+ ?9 }4 u2 7 3 1
) Z9 i# n% i I5 c7 A1 F+ ~3 79 25 7 1 . J; I+ H1 i5 K8 _ f
4 1021 253 61 13 1 2 \6 C: o5 T; A0 g* z" W' R
5 15621 3121 621 121 21 1) p# D. S; o; v* z, A
- H5 t( t0 P! C3 M9 n: D' G
/ U5 s5 u& v) K |
|