TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ( J5 E2 u1 G2 ]9 w4 b2 D0 m+ m
水风 发表于 2014-5-2 01:57 ; e) _+ Z( r) r! @" v) q \+ v
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 2 [8 _$ C( @: K6 B- U. F, E
$ O; m6 W B% g# ^fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
! P8 u4 H# g7 M/ U! J& ]; _- ]1 Y0 ?
% D9 t3 L* d3 T( s1 pThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
4 ]5 i5 S$ \$ b5 Y
! W# E- H9 C) k8 YAfter being divided (n+1) times, Z becomes 1, since X is fixed point.( O) K9 P3 M N( D) s
* a2 M0 ?4 G( H% E! p
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
+ J' H5 O" X5 ~6 m; ]" w2 V1 1
9 l# o9 X3 Z( `2 7 3 1 9 R3 _' S) x7 A, O; K! }
3 79 25 7 1
1 t0 n+ v( u5 ]# y* _' }4 1021 253 61 13 1
4 `, M+ ]0 E6 ?. l: {; G, |8 D! G5 15621 3121 621 121 21 1( b# }) _. W7 x5 v4 ~
( x" i( v4 i e9 \7 l5 B
. h+ h9 h; k/ D f, a: r |
|