Search Results for ""
2881 - 2890 of 9127 for Logistic Map R 2Search Results
What is the probability that a chord drawn at random on a circle of radius r (i.e., circle line picking) has length >=r (or sometimes greater than or equal to the side length ...
The divided difference f[x_0,x_1,x_2,...,x_n], sometimes also denoted [x_0,x_1,x_2,...,x_n] (Abramowitz and Stegun 1972), on n+1 points x_0, x_1, ..., x_n of a function f(x) ...
The following are equivalent definitions for a Galois extension field (also simply known as a Galois extension) K of F. 1. K is the splitting field for a collection of ...
Let n be an integer variable which tends to infinity and let x be a continuous variable tending to some limit. Also, let phi(n) or phi(x) be a positive function and f(n) or ...
In simple terms, let x, y, and z be members of an algebra. Then the algebra is said to be associative if x·(y·z)=(x·y)·z, (1) where · denotes multiplication. More formally, ...
A Julia set fractal obtained by iterating the function z_(n+1)=c(z_n-sgn(R[z_n])), where sgn(x) is the sign function and R[z] is the real part of z. The plot above sets ...
A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...
A cusp catastrophe is a catastrophe which can occur for two control factors and one behavior axis. The cusp catastrophe is the universal unfolding of the singularity f(x)=x^4 ...
A prime p_n is called "good" if p_n^2>p_(n-i)p_(n+i) for all 1<=i<=n-1 (there is a typo in Guy 1994 in which the is are replaced by 1s). There are infinitely many good ...
Let S be a nonempty set of real numbers that has a lower bound. A number c is the called the greatest lower bound (or the infimum, denoted infS) for S iff it satisfies the ...
...
View search results from all Wolfram sites (557507 matches)

