Search Results for ""

Let f(z) be an entire function such that f(n) is an integer for each positive integer n. Then Pólya (1915) showed that if lim sup_(r->infty)(lnM_r)/r<ln2=0.693... (1) (OEIS ...

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

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

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

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

Every point which can be constructed with a straightedge and compass, and no other points, can be constructed using identical matchsticks (i.e., identical movable line ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

The term "math" is the usual term for "mathematics" used in the United States. In contrast, the term "maths" is used in the United Kingdom.