TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑 ' W. e+ a9 w# x; O9 B4 C2 {& G
水风 发表于 2014-5-2 01:57 ![]()
* R2 K: ~& Y$ j. C# G再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... 2 q$ ~0 ^4 C3 S: }; [
; F, F7 |+ h9 T# [
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
" V9 C7 |1 R, d* H' q' r
& S: T, |* Z1 } z* l! _8 \The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.! d: |, \: v0 }7 i
) T# `$ k0 v5 ]3 p/ Q7 CAfter being divided (n+1) times, Z becomes 1, since X is fixed point.3 p2 d% Y" }! h+ V" H
; M' U' f! `2 F& W8 q7 ]+ kn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X 9 Y4 i5 n/ R6 T$ M8 I
1 1
# u4 A! z* S2 W6 R0 y, D4 C I/ k2 7 3 1
4 ?( F& j$ B' s' m9 m" ~4 q3 79 25 7 1
; y8 N, l7 b( e! g& w+ ^4 1021 253 61 13 1
$ e$ I; Q# c0 l& W% P$ A) Z5 15621 3121 621 121 21 1
) w0 G& E S4 Q2 C: ~; g
9 y# W; ~ w# G" W8 |. S5 ]/ m. d; J
|
|