Search Results for ""

If, for n and d integers, the ratio n/d is itself an integer, then d is said to divide n. This relationship is written d|n, read "d divides n." In this case, n is also said ...

A perspective collineation in which the center and axis are incident.

A modular form which is not allowed to have poles in the upper half-plane H or at iinfty.

To enumerate a set of objects satisfying some set of properties means to explicitly produce a listing of all such objects. The problem of determining or counting all such ...

The conjecture that Frey's elliptic curve was not modular. The conjecture was quickly proved by Ribet (Ribet's theorem) in 1986, and was an important step in the proof of ...

Suppose a,b in N, n=ab+1, and x_1, ..., x_n is a sequence of n real numbers. Then this sequence contains a monotonic increasing (decreasing) subsequence of a+1 terms or a ...

There exists an absolute constant C such that for any positive integer m, the discrepancy of any sequence {alpha_n} satisfies ...

An error-correcting code is an algorithm for expressing a sequence of numbers such that any errors which are introduced can be detected and corrected (within certain ...

For any two integers a and b, suppose d|ab. Then if d is relatively prime to a, then d divides b. This results appeared in Euclid's Elements, Book VII, Proposition 30. This ...

A special case of the Artin L-function for the polynomial x^2+1. It is given by L(s)=product_(p odd prime)1/(1-chi^-(p)p^(-s)), (1) where chi^-(p) = {1 for p=1 (mod 4); -1 ...