Search Results for ""
901 - 910 of 1529 for Exploration problemSearch Results
A nonnegative function g(x,y) describing the "distance" between neighboring points for a given set. A metric satisfies the triangle inequality g(x,y)+g(y,z)>=g(x,z) (1) and ...
If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...
Mills' constant can be defined as the least theta such that f_n=|_theta^(3^n)_| is prime for all positive integers n (Caldwell and Cheng 2005). The first few f_n for n=1, 2, ...
The Mills ratio is defined as m(x) = 1/(h(x)) (1) = (S(x))/(P(x)) (2) = (1-D(x))/(P(x)), (3) where h(x) is the hazard function, S(x) is the survival function, P(x) is the ...
Minesweeper is single-player logic-based computer game played on rectangular board whose object is to locate a predetermined number of randomly-placed "mines" in the shortest ...
An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...
Let five circles with concyclic centers be drawn such that each intersects its neighbors in two points, with one of these intersections lying itself on the circle of centers. ...
Let any finite or infinite set of points having no finite limit point be prescribed and associate with each of its points a principal part, i.e., a rational function of the ...
The nth raw moment mu_n^' (i.e., moment about zero) of a distribution P(x) is defined by mu_n^'=<x^n>, (1) where <f(x)>={sumf(x)P(x) discrete distribution; intf(x)P(x)dx ...
Given an m×n matrix B, the Moore-Penrose generalized matrix inverse is a unique n×m matrix pseudoinverse B^+. This matrix was independently defined by Moore in 1920 and ...
...
View search results from all Wolfram sites (160932 matches)

