TA的每日心情 | 擦汗 2016-4-17 12:18 |
|---|
签到天数: 1 天 [LV.1]炼气
|
本帖最后由 tingsanguo 于 2014-5-2 14:01 编辑
& V* w2 @9 W$ R- w水风 发表于 2014-5-2 01:57 . g5 g& u* O$ N/ ?4 W" [
再次重温自己与数学天才们之间的差距有多大了。解出来了,我还看不懂思路 ...
4 n* g9 t8 B2 d7 Z' P
6 _9 w- F; Q$ z' a9 U8 Z- Qfixed point f(X) = X = (1-n), where n is the number of people who divide the coconut., h# M1 q6 u- M; J6 Z4 E; u
) X2 r' _, Y) `2 S1 h
The least number of coconut before dividing is Z = [n^(n+1) + X], i.e., always divide (n+1) times.
3 O1 O/ T0 I5 p. }* ?5 h T f X5 z4 I2 i
After being divided (n+1) times, Z becomes 1, since X is fixed point.) K5 g) D5 u8 f% d0 l$ C- j
/ i$ w1 I+ I/ Q( S' @n n^(n+1)+X, n^(n)+X, n^(n-1)+X, n^(n-2)+X
5 Z: ~1 T0 v8 D$ z+ v1 18 s; p- G& G9 n3 W) U
2 7 3 1
$ w, d" L9 T) \4 r3 79 25 7 1
. ^1 \1 c6 }& M9 ~4 1021 253 61 13 1
" _* }# H# H; \' t5 15621 3121 621 121 21 10 V; i/ a* B, a. P" I# `
3 I( c! E9 [- d' B
+ U% C1 F. L* n( [# W0 X |
|