TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
- l' l8 F8 w; Y水风 发表于 2014-5-2 01:57 ![]()
2 _$ V/ F7 v9 u$ I5 g' S7 I9 @再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
: Z i4 S. t9 e6 F2 Q; k) q
X/ |0 {: a7 T( b" X, l" ifixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.' R6 N& `4 t% C" Z1 h
/ \8 h7 X V9 ]* ~" J! S
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.7 q+ h6 E1 C) Z2 K0 L
6 d; r0 S& x! }
After being divided (n+1) times, Z becomes 1, since X is fixed point.
: C# P6 s. `8 v* t1 q+ p; ?
5 P" ~; m4 }& n% gn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
- h0 U8 Y j: c1 f$ S1 10 b1 {3 H7 W6 d4 Q7 c2 V
2 7 3 1
' B) O! {- }$ e E. ~' R- c2 l! Y3 79 25 7 1
# y/ ?- r' G' ?2 T4 1021 253 61 13 1
$ p% K8 u/ U$ S$ D5 15621 3121 621 121 21 1
. Q# t7 _4 X/ ~0 S. \# j) F0 O9 V8 K U1 P1 i+ j
3 K. W$ \6 |) p |
|