TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
7 _2 e8 a" K& h$ j8 Q9 D1 Z水风 发表于 2014-5-2 01:57 * U5 J' f, S! O7 e9 s
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 8 F/ q8 x5 w0 y, l; r$ {
: W; W4 |$ U6 r6 H" ]2 g0 `
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
6 P" s" r4 _% V; B% |8 Y% l0 P; ^8 M
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
; q% |- d$ H/ M2 k# D# g+ U% H+ R* D9 D: j. d, B; h5 o- o5 {
After being divided (n+1) times, Z becomes 1, since X is fixed point.
; i& c* q r+ w) C7 D
9 b% X4 s* e1 S- ?2 Tn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X : E/ }+ p; }6 g
1 1) O* Y5 i# V3 j9 U* i8 {7 D9 Q
2 7 3 1 " {( c$ G) `' n
3 79 25 7 1
8 v" D( h5 P% ~2 N3 x B4 1021 253 61 13 1
$ _+ O4 A1 {8 t7 u8 b( Y* J6 }* a, s# m5 15621 3121 621 121 21 12 q% b4 q) m/ c- N3 C+ N
1 R( H/ _: \( d& A7 _6 p
# k2 Q3 B, o: B |
|