TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
$ u3 I0 M$ y- Q N; W, ?- }水风 发表于 2014-5-2 01:57 ![]()
6 o' H$ K) n2 @! @, c; F再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... Z0 Y: `0 ^! z0 }- z$ k2 r
# x: p3 ? I8 t! lfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.8 a5 p2 Z* `5 ^8 j$ C
Y9 N3 G6 {$ h
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.( }, ]0 m0 g0 a
9 n" z: r! ]+ ~: W* _) O6 cAfter being divided (n+1) times, Z becomes 1, since X is fixed point.; `# A+ x& _5 Y* Y
# |/ j7 h& c7 s! E+ P" w4 }
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 4 k6 S" W! @ @0 W+ c2 _
1 10 X. R% ^2 T9 `2 r( Q: Z! \
2 7 3 1 + `- C# N& P+ _- b& _( R
3 79 25 7 1 , @4 T( F. {. K! ]. L" E
4 1021 253 61 13 1 / T/ |; x4 Q7 B' q6 l3 R5 N% _" H5 c1 ?" r
5 15621 3121 621 121 21 1
* g) p9 f2 F: z2 T4 K% d1 f* A3 Q) @3 B; z
+ k5 |# z2 A: O, O7 n7 b2 M6 d, _& m |
|