TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
2 r0 |" x4 r; F水风 发表于 2014-5-2 01:57
5 z! }( ^' v A: t* _. J7 o- i1 z再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
: Q$ B* G9 E; K7 A. Y& s* {1 v' I- e, I
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
( s, d" v& |3 y" T0 ]2 Y3 b
. {' z9 j5 Z# BThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
# U. }7 L( r- N8 M+ x& w0 w* n( W% v9 s+ M: w# n
After being divided (n+1) times, Z becomes 1, since X is fixed point.) b% t0 t& }6 X0 T1 K
4 D, o% @+ ?- K2 a1 v; P5 p% in n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
# ^4 \) W% [0 a2 U+ H: Z1 1
9 J+ O2 X1 O$ ^8 ^) [; y. X2 7 3 1
3 u1 Z) D5 }: \2 X! {" A1 K3 79 25 7 1 # ?0 G2 t& l. j# ~0 P4 F
4 1021 253 61 13 1
4 Y8 R6 J- n0 K4 `8 f# `5 15621 3121 621 121 21 1! {* \$ J) f7 e9 ?; @
" w' Y% C# {! R' z) H9 t
p# K. d* K% G. E% c, i* w' Z |
|