Search Results for ""

The Gelfond-Schneider constant is sometimes known as the Hilbert number. Flannery and Flannery (2000, p. 35) define a Hilbert number as a positive integer of the form n=4k+1 ...

The upper and lower hinges are descriptive statistics of a set of N data values, where N is of the form N=4n+5 with n=0, 1, 2, .... The hinges are obtained by ordering the ...

A hyperelliptic curve is an algebraic curve given by an equation of the form y^2=f(x), where f(x) is a polynomial of degree n>4 with n distinct roots. If f(x) is a cubic or ...

A graph G=(V,E) is an interval graph if it captures the intersection relation for some set of intervals on the real line. Formally, P is an interval graph provided that one ...

The Jackson-Slater identity is the q-series identity of Rogers-Ramanujan-type given by sum_(k=0)^(infty)(q^(2k^2))/((q)_(2k)) = ...

The signature s(K) of a knot K can be defined using the skein relationship s(unknot)=0 (1) s(K_+)-s(K_-) in {0,2}, (2) and 4|s(K)<->del (K)(2i)>0, (3) where del (K) is the ...

For every ring containing p spheres, there exists a ring of q spheres, each touching each of the p spheres, where 1/p+1/q=1/2, (1) which can also be written (p-2)(q-2)=4. (2) ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

Also called the ménage problem. In how many ways can n married couples be seated around a circular table in such a manner than there is always one man between two women and ...

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...