TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
5 t0 r# q( u. B6 Y. f水风 发表于 2014-5-2 01:57 ![]()
8 q8 @" e5 V0 l7 g r* c再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
6 K: g7 ?6 ^, ` E6 P
7 N5 [- u1 a* ^fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut. x6 a+ T5 F# f5 M3 u+ z
! k# A9 G3 A9 l8 I3 y, c
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.5 K( O$ @5 a4 g/ N, a
# |# I4 F1 D, o( Q5 X( X
After being divided (n+1) times, Z becomes 1, since X is fixed point.
0 |& T( E! P+ N; t0 _$ \# Q9 B) L# J1 j1 `& Z
n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X / v+ u' a" Z# v+ ^0 l U4 J/ e
1 1. b6 a! p P( Q0 b. V1 g
2 7 3 1 * K, _& b( M; w
3 79 25 7 1 $ m @3 h, X, a( ~7 @2 Z
4 1021 253 61 13 1
+ f( F( d5 I! r5 15621 3121 621 121 21 15 e5 v V' ]7 L
7 d/ l3 v7 K7 a& d
* n- C: N6 f3 C) p
|
|