TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
0 B, v: ?/ d2 n1 H; y水风 发表于 2014-5-2 01:57 9 k, j. I+ p3 z
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 2 a& x5 `( p& P/ J |* {
8 _. Y) Z; ~7 v0 E8 Lfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.) @$ X1 B& M# v! Y% Q
" X6 ~: M- B! EThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.7 O q* }# w0 b; ?' ]7 Q
! i8 y4 W% i9 y& K) W: A# z, G
After being divided (n+1) times, Z becomes 1, since X is fixed point.
7 q0 S/ D2 \$ |7 l0 ^1 j( X( ^3 x6 E6 s, f1 k0 u) H2 b
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 7 h% L% m# y. d" C
1 1* U9 I! ]0 p/ [, }: o) n
2 7 3 1
7 f8 \/ O+ y/ b3 79 25 7 1 + K9 z* n. O( C1 ]
4 1021 253 61 13 1
+ g# V# a3 a S6 G4 W3 a5 15621 3121 621 121 21 1
1 v: r7 W; }) P6 E+ v: l
- d; @, |1 N; C) P5 H7 T
0 `0 B# q2 k% U( e |
|