TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 * I( ^5 K: z( K2 m$ d
水风 发表于 2014-5-2 01:57 ![]()
: F7 B6 D( D* \! a再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... " ?2 Z- V; t" `' H
% x; i6 v1 |/ `! } _* e# s* `fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut." G2 J6 _/ z+ n9 I* d: R+ m3 i2 f
$ h9 j3 A6 L) M X F+ O' @! d
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times./ X. s0 e) O6 G6 V _$ `
+ U. K' B+ z7 E% ^$ m/ P E! B) _! eAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
/ J, i( B' c0 k" I9 g3 Q
$ w D u: d' a* a( zn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X / m6 s( R' e' Z2 w. H- T! @6 [3 _
1 1
! h% b( X$ T& b2 B9 ? V2 7 3 1 " E4 P* t: k5 R8 ]; q- L& l. ]5 x( l
3 79 25 7 1
4 X5 D; [) m0 N7 [$ m4 1021 253 61 13 1 # F3 \$ S+ J/ D/ A& b
5 15621 3121 621 121 21 1
, f# Y2 r' l6 _. c
1 }0 {, N1 M& f3 ]; ^1 X7 J* O6 V. x+ J! }
|
|