TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
9 h+ s2 l( P+ O8 ?1 K" f' p水风 发表于 2014-5-2 01:57 ![]()
3 V( m. t2 W9 v再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
* `* s2 T, E8 z0 \, }. r) d* Y
0 n! M0 ^$ l+ D& n- }" {$ hfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
4 q' _' P- \; l0 v1 v
; ? P; c) z8 q8 X8 C3 F _The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
* v4 G t& e! O) n% T. P
: H' C; |* s b! n! _" ZAfter being divided (n+1) times, Z becomes 1, since X is fixed point.
+ N# _# g( q$ _+ X9 }8 ~" f7 K
5 Z! D# N7 \! e& U" k+ Bn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X n% N7 [' z1 X$ _; t! m8 I% B7 w
1 1 ^% t6 ]/ B) P$ @" x% R. G6 u
2 7 3 1 5 v% O, O8 o' B
3 79 25 7 1 . ?- ?2 _' ^8 _
4 1021 253 61 13 1 : r! C- P i4 ?9 ]+ `
5 15621 3121 621 121 21 1
- D' u1 l. ?- _7 X5 O' J1 Z: I. j i8 |! W1 B5 u# Y, _: }
6 P T. `6 r$ k } |
|