TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
9 |* C6 | `8 a! e水风 发表于 2014-5-2 01:57 ![]()
4 g6 r; i! |' `- p再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ... & ~# a3 f9 U j0 M7 v& |
' ]8 L; l& t" \+ ?8 A' F
fixed point f(X) = X = (1-n), where n is the number of people who divide the coconut.
6 I# H3 n! }3 S* n8 t/ @" u1 q9 c
5 `( ^2 \0 A- @& N' \; uThe least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
' k0 p/ _/ q/ ?, k4 ?7 i
1 e7 r9 M$ ]4 ?2 N/ U/ H. f; R& p1 jAfter being divided (n+1) times, Z becomes 1, since X is fixed point./ Y7 S2 F% u( j4 x
4 A: F$ X6 d: F W9 Qn n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
; h; v) f- U; y. S0 t& a6 N1 1
, V( f8 K% e1 T8 E6 V2 7 3 1 / J9 S7 G) L1 S- [4 a# K
3 79 25 7 1
' L3 S4 \9 e, N) V: i# s: X4 1021 253 61 13 1 0 `( o5 ?; w, l+ s$ v
5 15621 3121 621 121 21 1
( B3 ^3 p2 V' b0 o E& M/ g0 Q; `- _4 j1 R% v5 \( _
! }- v3 u: s$ G# ? |
|