TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 7 W* B# q! G5 @) X
水风 发表于 2014-5-2 01:57 ![]()
9 f& t3 p" i c" ~" d3 S7 ^再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
# K0 y- Z9 H1 a! i5 V: u: a1 t
& S0 m6 t. Y3 r. o5 ?% yfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
! L- _8 C2 x$ j' L# M/ ^% C/ b# O! S8 X5 \ a, o/ w
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
2 r( }2 f7 F% E+ U. ^! I% j
3 S" _+ _$ G, p0 ?1 b, n. uAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
! i2 Z8 O7 w: z+ d: s3 W! }7 M$ Z. B& E( Y8 w
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
9 G8 l* I* M; t7 R6 K1 1; y3 ]$ z+ s8 T1 Q' e* m S$ ]
2 7 3 1 ' A! |4 Y* {( r, q3 W9 D) x
3 79 25 7 1
. Z( f% B( J' T2 l- `9 a/ b6 g4 1021 253 61 13 1 3 Q( o9 x- @9 ^# y7 v
5 15621 3121 621 121 21 1
( R6 a& O# F0 g M8 G) `
% d* M) \) }. ^3 E, S3 b; y& \" U1 |2 n; S A
|
|