TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
' s# @ }; Y. G2 F6 d# |水风 发表于 2014-5-2 01:57 ( D7 f( x# D/ c2 |' _
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 5 O# o. `" [5 _2 d7 C8 t0 i5 O
- i- z2 {0 U! Z# w/ \ T8 a4 hfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.* T2 e/ P1 z& D( M
1 d0 T- l5 F A- G2 {% h+ J
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.& n1 Y# I: y2 v- F7 X, Z( C# |- U0 v
1 @7 T: y$ Q8 _/ M3 F' t( }After being divided (n+1) times, Z becomes 1, since X is fixed point.9 X4 }2 Z* K% P/ t- h& ~
$ R$ ]# C: I& @7 k" ]2 {# N: J& Wn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
0 i! B2 {: n8 X2 G9 I1 1$ [/ R3 k) Q; Z( W) N4 V
2 7 3 1 . Z! g3 c+ a" U" f# k8 l: T
3 79 25 7 1
; c' W g# }8 H, Z/ W2 ~+ ?, Y- u3 `4 1021 253 61 13 1
% j$ B1 B6 Q1 ?% d- I5 15621 3121 621 121 21 1: \+ W1 k0 V4 ^' ?
6 v( c5 ? ]% `( }+ W. @
+ F, [) t2 C2 P* t1 t4 b) G3 i |
|