Search Results for ""
4231 - 4240 of 13134 for complexity theorySearch Results
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, ...
A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...
A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...
There are four fixed points (mod 1) of Minkowski's question mark function ?(x), namely x=0, 1/2, f and 1-f, where f<1/2 is a constant known as the Minkowski-Bower constant ...
The Minkowski metric, also called the Minkowski tensor or pseudo-Riemannian metric, is a tensor eta_(alphabeta) whose elements are defined by the matrix (eta)_(alphabeta)=[-1 ...
A minor M_(ij) is the reduced determinant of a determinant expansion that is formed by omitting the ith row and jth column of a matrix A. So, for example, the minor M_(22) of ...
A modular inverse of an integer b (modulo m) is the integer b^(-1) such that bb^(-1)=1 (mod m). A modular inverse can be computed in the Wolfram Language using PowerMod[b, ...
The equation x_1^2+x_2^2+...+x_n^2-2x_0x_infty=0 represents an n-dimensional hypersphere S^n as a quadratic hypersurface in an (n+1)-dimensional real projective space ...
Let A={a_1,a_2,...} be a free Abelian semigroup, where a_1 is the identity element, and let mu(n) be the Möbius function. Define mu(a_n) on the elements of the semigroup ...
Write down the positive integers in row one, cross out every k_1th number, and write the partial sums of the remaining numbers in the row below. Now cross off every k_2th ...
...
View search results from all Wolfram sites (28442 matches)

