TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 8 g- G: E: x5 e/ X d4 z3 Y
水风 发表于 2014-5-2 01:57 ![]()
) L7 d6 ^& H, ?. e9 q) p; y再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
% t) g# P S8 D! U7 V c; Z' R; X& x* E* I; |. g: i( s, v# g
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.9 L& h* j* I ^- w5 a1 g. z
0 w1 I2 o- i6 q, A ?The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
% X2 N: l1 p: W M- J! D+ Q* v0 y. w, }, T
After being divided (n+1) times, Z becomes 1, since X is fixed point.3 K+ l8 A# \* x8 G; C7 _
1 u% h! B. Z% O/ `n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
5 R4 T M1 `% W) q6 t5 K1 P; Z1 1& O3 y6 X3 E, z9 D
2 7 3 1 . ^: ?) Q+ Y6 W d0 A
3 79 25 7 1
V$ @1 {4 m; ~2 x4 1021 253 61 13 1 , G" G' h/ ^. n2 ^# A; Z7 F4 C
5 15621 3121 621 121 21 1
, w3 d$ S' p$ a& C8 a& b2 T# @
& A! J- g5 L4 Y6 c+ m
% x* [$ h$ ?: |; o |
|