TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
. ?! V5 c. G/ _3 } \水风 发表于 2014-5-2 01:57 z% T c8 i/ b8 [0 @
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... & H Z) f& i5 \. e! W {" C) d! K) Y
- z( D( W7 t6 K" s- @2 f9 Afixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
5 C% A2 j. R3 M4 g: R/ k6 e( l B( U( j z* l
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
& V( Q# ?- w7 K# C
6 [9 u: a' r( ]+ `After being divided (n+1) times, Z becomes 1, since X is fixed point.9 i9 a8 u9 A! J. X$ v+ Y7 j
" v- x* d6 b; I! _. T
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X " _. j9 v8 q# f2 n
1 1( x: S# s" ~5 \+ s" J
2 7 3 1
/ r* s7 u3 D& o% i1 K+ F3 @3 79 25 7 1
5 g% j( j2 u- a+ _4 1021 253 61 13 1 , u t) S5 F8 R
5 15621 3121 621 121 21 19 D% j3 `' ~; \* w u \+ g
$ W7 c- ?: G) B: R
* _) Y0 y- ^, N9 u |
|