TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
% a& b3 d% |( c) L4 L' ]水风 发表于 2014-5-2 01:57 ![]()
* f; c$ g7 h7 C, ?- _再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... / w# Z# ?( `" {: I
. t' b( r* j! X* S7 T! L1 Hfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
) d4 n: F/ h. k9 G( a. q3 {3 }2 [
* w0 V( A! t- u) tThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
% N4 ]- P1 |! M9 T$ P8 U5 @# A: J: y
& S6 `, T. w/ @After being divided (n+1) times, Z becomes 1, since X is fixed point.
$ F( L6 M: E$ F. a* Y J
: L, m' K3 g; y) b5 s( \) Nn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
6 Y+ G& H/ D+ B" b* |3 ]0 A* o1 1/ {% X- _: S5 V d2 d
2 7 3 1 ' F, b8 M$ a8 l3 E* O4 T5 X
3 79 25 7 1 ' G* Q9 x" X3 `* R2 W8 `
4 1021 253 61 13 1 ; T; w ?1 B8 C$ D: j1 P
5 15621 3121 621 121 21 1- _+ i1 @0 k! n0 L0 |* M
- }' A6 ]" g3 k6 e4 V1 K, X: m
2 a$ v- T2 {# Q1 j4 T1 e. C |
|