TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 8 x4 N- m5 U# y! K
水风 发表于 2014-5-2 01:57 ![]()
: W; e( T7 y/ e' n再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
% Z: w. v( _) _: ^' S. \% v7 ^: `- E4 y" x/ E D$ Q
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.6 q! T6 H+ w! H _7 X, j4 [# F
2 z! M4 K5 G7 B5 a/ H
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
7 [- X/ l# T; r* _
4 G# P" d. e0 L5 D0 u" Q* T- xAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
( K9 F0 P& U! ?; K+ y, f; y, G$ H0 q2 e) P
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
, `% I5 r% a' ?* _5 }1 1
. \1 Q- {+ P" ^2 7 3 1 0 g) F! I/ n0 S
3 79 25 7 1 }0 S, Q& z/ |8 a) Y8 ~2 H R7 ?
4 1021 253 61 13 1
$ i) o5 N9 W9 t% U* r t5 {5 15621 3121 621 121 21 1
! ~( n9 Y9 s! k* Q H8 [) a$ ^/ |# N. M
: T! M0 M2 l3 k: i: S o |
|