TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
. h$ X, E0 M9 |. w% h: R水风 发表于 2014-5-2 01:57 ![]()
; e! @; _# c; @$ z; ^再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
/ E* {( h2 S2 A0 G/ k7 K* e! ~! D0 W6 J. h
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
" E6 c) @9 q, c5 V
0 M9 }; x) w3 Y1 c* d# gThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
3 z/ C6 s- p5 k/ e( G' ^# U
; `$ K* `& T6 `$ W' F/ R, oAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
6 F. x! B$ F4 G' Y" Z6 |. T2 B0 T3 u: W0 h
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
8 x7 `( L1 ^; r& m/ t8 E5 B1 1/ O" K4 A1 n4 G6 ~7 Z8 [- v, |4 |6 }
2 7 3 1
! `, I9 n- I; Q3 79 25 7 1
4 G/ m, J- d$ n& O7 G8 Y4 1021 253 61 13 1
! l- K" H0 U' Y: f# Q5 15621 3121 621 121 21 1
' {& c0 k' p& |7 a! G v9 e$ A; u
, y, C) \6 v6 s4 b K5 x. H5 I0 u
|
|