Search Results for ""

The Bernoulli numbers B_n are a sequence of signed rational numbers that can be defined by the exponential generating function x/(e^x-1)=sum_(n=0)^infty(B_nx^n)/(n!). (1) ...

A statistic which assigns a single number to several individual statistics in order to quantify trends. The best-known index in the United States is the consumer price index, ...

There exist infinitely many odd integers k such that k·2^n-1 is composite for every n>=1. Numbers k with this property are called Riesel numbers, while analogous numbers with ...

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

The Stiefel-Whitney number is defined in terms of the Stiefel-Whitney class of a manifold as follows. For any collection of Stiefel-Whitney classes such that their cup ...

A generalization of Poncelet's continuity principle made by H. Schubert in 1874-1879. The conservation of number principle asserts that the number of solutions of any ...

A number n is called amenable if it can be built up from integers a_1, a_2, ..., a_k by either addition or multiplication such that sum_(i=1)^na_i=product_(i=1)^na_i=n (1) ...

Let sigma_infty(n) be the sum of the infinitary divisors of a number n. An infinitary perfect number is a number n such that sigma_infty(n)=2n. The first few are 6, 60, 90, ...

An abundant number for which all proper divisors are deficient is called a primitive abundant number (Guy 1994, p. 46). The first few odd primitive abundant numbers are 945, ...

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...