Search Results for ""
6251 - 6260 of 13135 for Computational GeometrySearch Results
Also known as Kolmogorov entropy, Kolmogorov-Sinai entropy, or KS entropy. The metric entropy is 0 for nonchaotic motion and >0 for chaotic motion.
The minimum excluded value. The mex of a set S of nonnegative integers is the least nonnegative integer not in the set.
A sequence defined from a finite sequence a_0, a_1, ..., a_n by defining a_(n+1)=mex_(i)(a_i+a_(n-i)), where mex is the mex (minimum excluded value).
The middle levels conjecture, also known as revolving door conjecture, posits that the middle layer graph has a Hamilton cycle for every n>=1. The conjecture was proved by ...
Given order statistics Y_1=min_(j)X_j, Y_2, ..., Y_(N-1), Y_N=max_(j)X_j with sample size N, the midrange of the random sample is defined by MR=1/2(Y_1+Y_N) (Hogg and Craig ...
If the period of a repeating decimal for a/p, where p is prime and a/p is a reduced fraction, has an even number of digits, then dividing the repeating portion into halves ...
For a catastrophically unstable recurrence in one direction, any seed values for consecutive x_j and x_(j+1) will converge to the desired sequence of functions in the ...
The series with sum sum_(n=0)^infty1/(F_(2^n))=1/2(7-sqrt(5)), where F_k is a Fibonacci number (Honsberger 1985).
The number 1000000=10^6. While one million in the "American" system of numbers means the same thing as one million in the "British" system, the words billion, trillion, etc., ...
A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...
...
View search results from all Wolfram sites (173967 matches)

