Search Results for ""

The totient function phi(n), also called Euler's totient function, is defined as the number of positive integers <=n that are relatively prime to (i.e., do not contain any ...

The triangular number T_n is a figurate number that can be represented in the form of a triangular grid of points where the first row contains a single element and each ...

The Tutte 12-cage, also called the Benson graph (Exoo and Jajcay 2008), is the unique 12-cage graph, equivalent to the generalized hexagon GH(2,2) and alternately called the ...

The Weierstrass elliptic functions (or Weierstrass P-functions, voiced "p-functions") are elliptic functions which, unlike the Jacobi elliptic functions, have a second-order ...

Zero is the integer denoted 0 that, when used as a counting number, means that no objects are present. It is the only integer (and, in fact, the only real number) that is ...

The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...

A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...

Apéry's constant is defined by zeta(3)=1.2020569..., (1) (OEIS A002117) where zeta(z) is the Riemann zeta function. Apéry (1979) proved that zeta(3) is irrational, although ...

The important binomial theorem states that sum_(k=0)^n(n; k)r^k=(1+r)^n. (1) Consider sums of powers of binomial coefficients a_n^((r)) = sum_(k=0)^(n)(n; k)^r (2) = ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...