TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 " G( q3 _5 {5 F: W9 d) F/ O4 [: J/ G
水风 发表于 2014-5-2 01:57 3 F( g" ]6 S5 i7 z0 ~ ^
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
2 l I# Q9 v/ y: V+ F
3 L7 A; P" j" ~. p7 F% q& Kfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.; I7 `8 ^ Q1 w( E. n. K! n! B. {- Z0 ?
, k" E9 M: X9 K4 q1 N
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.8 t. v3 Q4 u2 ~
4 I j4 i% y% `After being divided (n+1) times, Z becomes 1, since X is fixed point.
' a3 L& @+ {( s8 B! v
0 V7 b9 F) J$ W( @5 V- q( Bn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
/ ?# t+ z, W* ~4 P! ^7 A* g1 1
% d' j. D. L/ V5 r3 I2 7 3 1 ' i, L" j( o% V* ]; [/ f
3 79 25 7 1 ! O, m( P3 M( ^3 ~4 v: y: j5 N
4 1021 253 61 13 1
- R4 r. w1 s3 N% @9 y) u, ^( i5 15621 3121 621 121 21 18 s6 g$ U9 a' ^2 P1 u
( L0 f& A3 K8 Z% }: R( F, j% g5 r' r) w2 l5 {
|
|