TA的每日心情 | 擦汗 2016-4-17 12:18 |
---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
) C3 d9 F5 u2 x( U7 x/ T; v; P水风 发表于 2014-5-2 01:57
4 I" W/ j2 `- ~+ F再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
1 t' T# G$ j1 q7 E4 I& z" s2 e' P: I3 v" w0 k5 }- y& y8 e& s
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.7 h3 v' {" c! E3 D. M9 [
, `3 W7 u9 ?5 g8 lThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times., I+ W( _* [/ `3 X2 n5 Z
Z7 {" V, _8 p d [' S
After being divided (n+1) times, Z becomes 1, since X is fixed point.! [/ x5 ~, r6 q) A8 v3 y
/ d1 _: d& @' Z# Z( v% d9 i: ^7 L9 Yn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X # e3 T3 H; b" e. M0 \
1 1
' D+ |) z' U( v2 r4 O2 7 3 1
+ G- L' r# g2 G0 Q3 P3 79 25 7 1 " E$ K( z/ I3 }% ?1 W' v- s# `7 x3 U
4 1021 253 61 13 1 7 e! ]& t/ O& | \+ P' l) g
5 15621 3121 621 121 21 1
7 x# [1 g# Y. F) ^& [
: l9 {; x. q% [/ Y/ o+ v# C8 z3 _3 W4 K$ o. Q* D9 {
|
|