Search Results for ""

Mastermind is a simple two-player code-breaking board game invented in 1970 by Mordecai Meirowitz, an Israeli postmaster and telecommunications expert. It may have been ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings in ...

The triangle DeltaM_AM_BM_C formed by joining the midpoints of the sides of a triangle DeltaABC. The medial triangle is sometimes also called the auxiliary triangle (Dixon ...

The Meringer graph is one of the four (5,5)-cage graphs, discovered by Meringer (1999) after it had long been thought that only three such cages existed. Like the other ...

A Mersenne number is a number of the form M_n=2^n-1, (1) where n is an integer. The Mersenne numbers consist of all 1s in base-2, and are therefore binary repunits. The first ...

Given the Mertens function defined by M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function, Stieltjes claimed in an 1885 letter to Hermite that M(x)x^(-1/2) stays ...

The Mertens constant B_1, also known as the Hadamard-de la Vallee-Poussin constant, prime reciprocal constant (Bach and Shallit 1996, p. 234), or Kronecker's constant ...

The Mertens function is the summary function M(n)=sum_(k=1)^nmu(k), (1) where mu(n) is the Möbius function (Mertens 1897; Havil 2003, p. 208). The first few values are 1, 0, ...

The term metric signature refers to the signature of a metric tensor g=g_(ij) on a smooth manifold M, a tool which quantifies the numbers of positive, zero, and negative ...

Calculus of variations can be used to find the curve from a point (x_1,y_1) to a point (x_2,y_2) which, when revolved around the x-axis, yields a surface of smallest surface ...