TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 7 M! ~ K0 _4 M# x2 ?
水风 发表于 2014-5-2 01:57 ![]()
% W6 x' K, e3 }, ]8 K再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... W/ | B/ I' G, l! J5 k* F2 j
7 D; |# g! J" f) q# V1 y3 h. y# Zfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.9 u7 e* X4 v+ W8 ]2 L; {9 |" h/ l, z
9 Z2 t% m+ [% v' z. I5 H, I& w
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
0 W5 h( y" A( H* O2 Z. N3 o6 }" m t: w' e! H9 T H) C0 c
After being divided (n+1) times, Z becomes 1, since X is fixed point. _% P0 E, d' W% |% p' c3 I
/ T- O. g! @( g' \n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
# w1 Q" L! S1 }4 W: H9 ^4 N6 u1 1
6 m* {" a+ C% \. Q# }5 Q9 o2 7 3 1 ) \! ` ]) ]4 i; R* `
3 79 25 7 1 " Q1 z. B; @2 x4 w/ R
4 1021 253 61 13 1
( {! z! }8 W* N/ Y r; ?# \( z5 15621 3121 621 121 21 1/ D* g& q0 n3 A
4 V9 q0 Y4 d1 f9 N- ]* B D) p
& x. F: |/ R' a" J |
|