TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
$ K1 N' _, n! z, s水风 发表于 2014-5-2 01:57 + h: w) O l- x1 F
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
: |! _1 B6 `! ?" R1 Y5 c5 H8 W# A! s( E$ N, E
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
. R) z( R {# m4 D! F' u: }* H N, F' h$ j0 S
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
! ^8 r1 q" a2 n4 |& n+ `) Z: x& A- n# c7 Z9 O/ |
After being divided (n+1) times, Z becomes 1, since X is fixed point.
$ E8 K8 H' d+ A, A S+ j! @7 a: f' O5 Z# |
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 2 P) Z5 H4 }6 l6 A: t
1 1, Z$ x9 X2 ^! J, Y# w; N
2 7 3 1
- J1 U$ O) I% @0 e3 79 25 7 1
8 T* r! z3 y; k$ l+ @. l4 R+ k/ O4 1021 253 61 13 1 : Q* M5 m- S5 L+ M. v) |
5 15621 3121 621 121 21 1
: q6 d8 u" q6 {$ S& _
( n7 z% j7 O% ~7 t- a& r7 s! X5 D2 a
|
|