TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
2 t4 i/ r z0 u7 z水风 发表于 2014-5-2 01:57 ![]()
0 m9 [( W- I2 A, K: M8 T- X- ]再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
0 c5 T# c# m8 C3 t5 C. q' D! t/ ^7 s7 _4 v. k( a
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.' g+ [8 k! |# a) E B2 A
, ?* ~5 [4 {. S8 Z$ I
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
: c: d5 s6 G, f9 ^1 J
( ]; f( ~' y( W$ U. x7 }After being divided (n+1) times, Z becomes 1, since X is fixed point.
' F4 e/ _. v. ]
9 I: G$ @1 v. d* Yn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
9 M6 b# U+ V$ ?$ I: T4 L1 1% W2 E+ A5 s" A7 V* k( Q" _8 p6 F( M( n
2 7 3 1 . f; U' [" A+ @8 L8 o4 O
3 79 25 7 1
6 Q; O5 s' c" r' v5 A* K1 A4 1021 253 61 13 1
$ f" F% N) {) O- ~ U& P9 |5 15621 3121 621 121 21 15 D1 N Z" A' }
+ n+ v' g0 x1 p, x/ Q" k3 c
2 B8 g _' u+ p& r- g: g7 K* C" s+ X, S |
|