TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
1 C7 ~, I, R7 c+ U m1 T水风 发表于 2014-5-2 01:57 5 q0 \: z/ ^/ H# |
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
" o6 V& i2 I! x
: b# O$ d. V' r/ E& u# P: |6 lfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
# |, E i6 \2 V! [7 S! \, j' h" w/ q/ [: G/ c
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
8 j% l# R6 _. n7 R2 x5 } I5 H9 h; U3 }/ {3 n/ W) C$ c. T
After being divided (n+1) times, Z becomes 1, since X is fixed point.
; _: f. ?* D8 D( ?4 R, s
, F$ k3 ~) q/ Z9 Sn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
* H1 g( n# Z8 E( h1 10 a4 A2 C @7 }$ I2 O
2 7 3 1 4 |" A1 t. G) B; _" M) f
3 79 25 7 1
W- h& o9 p1 N2 b. |7 K4 1021 253 61 13 1 . `1 [. ~/ L4 u+ w# r' p
5 15621 3121 621 121 21 1- o2 m, r/ w, L
9 f8 m# ?$ R+ N
$ y8 K& Y- \/ u4 Z$ \/ Q |
|