Search Results for ""

A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...

Given n matches (i.e., rigid unit line segments), find the number of topologically distinct planar arrangements which can be made (Gardner 1991). In this problem, two matches ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...

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

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

A Banach space X is called minimal if every infinite-dimensional subspace Y of X contains a subspace Z isomorphic to X. An example of a minimal Banach space is the Banach ...

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

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