TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 - {4 \" J# |, w4 U
水风 发表于 2014-5-2 01:57 0 g# K8 J2 K2 V' X4 p% A0 W
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 7 f: J0 Z! D! t4 d: L1 k" w
- F' n) _ F5 U7 f. N
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
( U" i! S1 Z4 S* R* \
! r3 l! |" D. A h7 y# P; E3 @* hThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
4 T" E X7 Z! G- j! R1 m; c$ f$ c6 ` ~
After being divided (n+1) times, Z becomes 1, since X is fixed point.
7 ~/ G, o% m6 j5 A9 j8 i' C3 y4 p7 x$ g2 [8 w6 X( f
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 4 t' ^7 }' u- H- J8 x* o9 w- v
1 1
0 ]! a4 o4 {" a: F# O @' ?2 7 3 1 8 S: @* d4 g) \. e
3 79 25 7 1 / V4 g" F& r7 A; e, C
4 1021 253 61 13 1 , N! y7 B/ ?0 x. B/ J' H
5 15621 3121 621 121 21 11 g0 y$ F' E& `1 @0 t4 Z8 I$ U
# U/ _0 d# P' i/ g
]' k1 O% A$ N: Q2 u8 i. _
|
|