TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
9 J. S: ?/ I4 ]' N# O水风 发表于 2014-5-2 01:57 8 x) j8 L( m8 n
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
: G3 A6 C# {% p+ c" g+ U9 f, t- b- Y9 }9 @
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
2 K! k& K2 E( \/ v( U* m; L
1 U7 Y, M$ S4 m( y( L% V5 xThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
4 j, h, P# _- m) _: y/ x: D* G
8 b1 k2 G9 y6 T' \3 R4 m* Z' OAfter being divided (n+1) times, Z becomes 1, since X is fixed point.( n9 ^* Z4 M R7 J; n
4 `6 E) k2 ~' { P; a& l# k7 W# y
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
" J& G" m$ }7 v( G' S1 1
5 g7 n3 b8 O/ D% h7 B. n2 7 3 1
( r. s( T0 L% k5 j3 i' _* d3 79 25 7 1 ! W2 ^8 Z" ]' m8 z
4 1021 253 61 13 1 2 c2 J/ |2 A& b4 O$ c& S8 M, g3 {" I
5 15621 3121 621 121 21 1
# O1 r9 G7 V8 j
N* b8 F3 i" F8 ]( {; E
7 q8 L$ E; G6 p3 y }& Q |
|