Search Results for ""

The number of empty neighbors of a cluster.

The number q in a star polygon {p/q}.

An integer d is a fundamental discriminant if it is not equal to 1, not divisible by any square of any odd prime, and satisfies d=1 (mod 4) or d=8,12 (mod 16). The function ...

A number r is an nth root of unity if r^n=1 and a primitive nth root of unity if, in addition, n is the smallest integer of k=1, ..., n for which r^k=1.

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 ...

An integer n is p-balanced for p a prime if, among all nonzero binomial coefficients (n; k) for k=0, ..., n (mod p), there are equal numbers of quadratic residues and ...

The numbers 2^npq and 2^nr are an amicable pair if the three integers p = 2^m(2^(n-m)+1)-1 (1) q = 2^n(2^(n-m)+1)-1 (2) r = 2^(n+m)(2^(n-m)+1)^2-1 (3) are all prime numbers ...

A family of operators mapping each space M_k of modular forms onto itself. For a fixed integer k and any positive integer n, the Hecke operator T_n is defined on the set M_k ...

Fatou dust is a Fatou set for a point outside the underlying set. Such a set has zero area and has an infinite number of disconnected components.

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...