Search Results for ""

The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...

In two dimensions, there are two periodic circle packings for identical circles: square lattice and hexagonal lattice. In 1940, Fejes Tóth proved that the hexagonal lattice ...

A power is an exponent to which a given quantity is raised. The expression x^a is therefore known as "x to the ath power." A number of powers of x are plotted above (cf. ...

A transcendental number is a (possibly complex) number that is not the root of any integer polynomial, meaning that it is not an algebraic number of any degree. Every real ...

In his Meditationes algebraicae, Waring (1770, 1782) proposed a generalization of Lagrange's four-square theorem, stating that every rational integer is the sum of a fixed ...

A Mersenne prime is a Mersenne number, i.e., a number of the form M_n=2^n-1, that is prime. In order for M_n to be prime, n must itself be prime. This is true since for ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

Let s(n)=sigma(n)-n, where sigma(n) is the divisor function and s(n) is the restricted divisor function. Then the sequence of numbers s^0(n)=n,s^1(n)=s(n),s^2(n)=s(s(n)),... ...

Baillie and Wagstaff (1980) and Pomerance et al. (1980, Pomerance 1984) proposed a test (or rather a related set of tests) based on a combination of strong pseudoprimes and ...

Brocard's problem asks to find the values of n for which n!+1 is a square number m^2, where n! is the factorial (Brocard 1876, 1885). The only known solutions are n=4, 5, and ...