Search Results for ""

Let A_(k,i)(n) denote the number of partitions into n parts not congruent to 0, i, or -i (mod 2k+1). Let B_(k,i)(n) denote the number of partitions of n wherein 1. 1 appears ...

Let G be a k-regular graph with girth 5 and graph diameter 2. (Such a graph is a Moore graph). Then, k=2, 3, 7, or 57. A proof of this theorem is difficult (Hoffman and ...

A beautiful general theorem of which the following two statements are special cases (Coxeter and Greitzer 1967, pp. 99-100). 1. If DeltaABC and DeltaA^'B^'C^' are two ...

Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...

The prime number theorem gives an asymptotic form for the prime counting function pi(n), which counts the number of primes less than some integer n. Legendre (1808) suggested ...

The square-triangle theorem states that any nonnegative integer can be represented as the sum of a square, an even square, and a triangular number (Sun 2005), i.e., ...

Given three circles, each intersecting the other two in two points, the line segments connecting their points of intersection satisfy (ace)/(bdf)=1 (Honsberger 1995).

For the rational curve of an unperturbed system with rotation number r/s under a map T (for which every point is a fixed point of T^s), only an even number of fixed points ...

Condorcet's jury theorem states that given a group of voters (a "jury") independently choosing by majority vote between a correct outcome with probability 0<=p<=1 and an ...

A formula also known as the Legendre addition theorem which is derived by finding Green's functions for the spherical harmonic expansion and equating them to the generating ...