TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
( A1 |. I% J5 \" j水风 发表于 2014-5-2 01:57 6 ~, e/ }1 _0 P/ Y; u
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 9 v1 \5 B9 a5 w2 y
+ e: H0 R2 F" e6 w8 S1 vfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.* W4 G9 F- `/ Y6 k8 A% w
" ]6 F1 i9 N- P4 x
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.4 _1 M# N! Q# h0 M/ W
3 s% b$ D. D/ O. f% q9 BAfter being divided (n+1) times, Z becomes 1, since X is fixed point.# \: c* D# D+ i* o; u3 i; i
1 e6 f5 X; H) }+ E; \, C
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
$ ]) _1 z" o; a* t1 1& T- h' k. I6 x, ^8 H8 s8 |
2 7 3 1 ( ]2 Z: ?1 ]( s3 ^. }
3 79 25 7 1
8 ]* H1 W6 V, [& m& y4 1021 253 61 13 1
6 q) c5 L+ w+ \* Q# ~, M5 \" g! p5 15621 3121 621 121 21 1. y3 ^) I$ V0 B3 ?) ]5 a
0 ~& c6 ?, \# @3 P# F
% b9 p B+ d9 _2 D2 b" i
|
|