TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ! O- |) h1 M! z) |3 G
水风 发表于 2014-5-2 01:57 ![]()
[( ] ^# j- a2 ?) ^8 j0 J再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
8 I% r- Y, K, }& I' O# I6 E
2 g* S) P* [; ]9 L3 |* h) \fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
$ u4 r+ x ~+ D) f6 v9 i- ]3 f
: f6 ]9 _! p( I$ p9 j3 k; _The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
- u, d2 k1 @5 r% d+ J6 R; l
% x" f5 @3 O# t& a' R7 KAfter being divided (n+1) times, Z becomes 1, since X is fixed point., F. `* H. ?9 U5 K. w4 t# z- X
' j+ I; H ?% ?' j+ `
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X : \1 q( |" p( \ t* R( X. H
1 1
N4 H @! E& u L6 T- z3 m i2 H. f2 7 3 1
4 [ D9 e# b( m! y6 o3 79 25 7 1 . ~1 E6 G9 H3 b% e4 Z5 O: v q5 ?2 x
4 1021 253 61 13 1
, J, l8 \4 u: E. i( Y5 15621 3121 621 121 21 13 l, C' K% Q3 S {2 v' o6 I
1 Q( b' D0 l( @, h$ g9 C" A: B) s/ K8 z U
4 b- G8 F# z9 X
|
|