TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 # \. C- Y: W4 `9 f9 R- n3 _8 a5 e
水风 发表于 2014-5-2 01:57 ![]()
& J: U' |/ e2 h: ], V再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
7 @+ e5 V, q8 I$ M) ~
* U8 D; D' \% L4 C! ~fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
* c2 F" Z2 @8 B) N8 |2 H9 x' E" l$ q ?! N1 b6 W. |. F8 @" a
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
* @" y/ C+ C9 J. F! c0 q0 @
5 e* y# ?( h" b9 eAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
- G0 g9 h I, P4 N
# H% N# O* F) i( w# Wn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X / h- O: K# @8 R# ~' g0 |
1 12 e$ G; k8 y- o; p7 _/ {$ C
2 7 3 1 b1 Q) i1 ?$ q% `
3 79 25 7 1 4 t9 n7 I" y# o2 [5 S0 Q5 a8 p
4 1021 253 61 13 1 R) |) F& X$ M" i8 d
5 15621 3121 621 121 21 1- L8 e: q8 q& D( W+ d) X
; I& @( c- S( ]/ v8 ~9 F% H
' ?: F& O( N9 K- O+ n1 p
|
|