TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 0 n- G! W! \( g2 {% @' J2 k k
水风 发表于 2014-5-2 01:57 ![]()
" A9 r2 @$ l% B- K2 D) E再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
! r3 C {# X3 Y* A) Q/ D+ r4 [7 ]" p7 z: X/ ]. w" }3 R
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
; h& G6 S& f# k( ~8 ]) p" i, H, v& q1 U+ s
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
& o( s* {/ p/ s. V! N" O' P$ p% S- j
2 ^8 y- f0 _' R, Z* U6 Z# b+ VAfter being divided (n+1) times, Z becomes 1, since X is fixed point.7 d- D$ p. x# n7 t* C7 }5 f* T
9 x2 ?9 t. Y, f$ w( Dn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X # V/ u* M/ X" t [
1 1
" e. ?- I" n0 x" |0 T" k3 F' H0 c2 7 3 1 & u3 Z. I& E% G: x
3 79 25 7 1 & e2 }5 W" Q: y
4 1021 253 61 13 1
8 M4 u% b3 n! N" N5 15621 3121 621 121 21 1
0 \' S. m* i0 b) i# i
( J \6 y# y, P: ^& _) H. q+ ]- ^/ v+ y, n
|
|