Math in Codes
Fixed Point Theorem
================
fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F that can be stated in general terms. Results of this kind are amongst the most generally useful in mathematics.
F(X) = R*X*(1-X)
1. Loop 200,000 times -> get a new value of R (using formula above)
2. Loop 1000 times -> get minimum and maximum values (using formula above)
-------------------
double.MAX_VALUE
double.MIN_VALUE
================
fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F that can be stated in general terms. Results of this kind are amongst the most generally useful in mathematics.
F(X) = R*X*(1-X)
1. Loop 200,000 times -> get a new value of R (using formula above)
2. Loop 1000 times -> get minimum and maximum values (using formula above)
-------------------
double.MAX_VALUE
double.MIN_VALUE
コメント
コメントを投稿