TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 " @. i) s. H P; ?! `
水风 发表于 2014-5-2 01:57 ![]()
% R4 R! H8 P1 V. N) e再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
' t7 f' N3 ?; p" K" T" }! w2 c# @: A! K3 G E
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.( y8 b$ T& k6 V3 h3 W, O2 \
7 h# S0 r5 l0 v2 E
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
( r' D2 |: y0 G& q# |) [- G7 }
+ I+ t+ f3 E( b/ Z5 {. sAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
. n/ p. L1 `& o: T( Q5 U8 r! V6 Z% Y+ ?5 o; ] v7 A: ~3 d6 t
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X ; @7 C3 g+ u8 z8 a
1 1
8 b; U6 d) @' D5 m! l, |' f9 r; d2 7 3 1 * j/ ^& d- s4 m! P* a
3 79 25 7 1
6 X+ d8 R& E8 o2 J# }5 y) _4 1021 253 61 13 1 4 l/ P4 r) j5 S% J" F. \0 o8 U
5 15621 3121 621 121 21 19 u+ O% d9 c* |# o" t1 H$ ?
# \# ~. y* s+ J: R) K5 U' D
/ v P! c! c4 X9 A8 V, F4 H |
|