TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
8 w3 Y1 I. D) z9 K" |水风 发表于 2014-5-2 01:57 ( L. c6 J- z0 V9 v7 o, @. N
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 9 ]2 i# a, C) K* I0 t5 w5 V
" E" k, _! Q0 V% i1 ofixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
c) E& Q! c. P9 G) a5 y2 W) _) q3 C0 M
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.: c+ ~1 _- }# Z/ B0 O
- U& u! C& Y* r0 d' X/ FAfter being divided (n+1) times, Z becomes 1, since X is fixed point., l2 m1 @/ w: \( ?* v7 O3 t3 Q
& H7 [8 ?) R) @0 Y5 t8 l6 t* Wn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 1 U: A* `1 B/ T
1 1
; ?! a0 j# }( i3 m2 7 3 1 & F( X% D1 F! x \2 R* `: l
3 79 25 7 1
+ P. y; _1 C. e) d4 1021 253 61 13 1
: z! g% S+ G/ j6 J6 F* X5 15621 3121 621 121 21 1
k- H9 s/ j0 ]) c- A
1 L# n5 @5 p3 r: ^9 H& H' X0 V* c4 T( n( P5 }
|
|