Search Results for ""

A metadrome is a number whose hexadecimal digits are in strict ascending order. The first few are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, ... ...

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

The sequence produced by starting with a_1=1 and applying the greedy algorithm in the following way: for each k>=2, let a_k be the least integer exceeding a_(k-1) for which ...

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, ...

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 ...

For a triangle DeltaABC and three points A^', B^', and C^', one on each of its sides, the three Miquel circles are the circles passing through each polygon vertex and its ...

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, ...

Module multiplicity is a number associated with every nonzero finitely generated graded module M over a graded ring R for which the Hilbert series is defined. If dim(M)=d, ...

Draw a circle that cuts three given circles perpendicularly. The solution is known as the radical circle of the given three circles. If it lies outside the three circles, ...