Search Results for ""

An extremely fast factorization method developed by Pollard which was used to factor the RSA-130 number. This method is the most powerful known for factoring general numbers, ...

If p is prime, then p|P(p), where P(p) is a member of the Perrin sequence 3, 0, 2, 3, 2, 5, 5, 7, 10, 12, 17, ... (OEIS A001608). A Perrin pseudoprime is a composite number n ...

One form of van der Waerden's theorem states that for all positive integers k and r, there exists a constant n(r,k) such that if n_0>=n(r,k) and {1,2,...,n_0} subset C_1 ...

Let S(x) denote the number of positive integers not exceeding x which can be expressed as a sum of two squares (i.e., those n<=x such that the sum of squares function ...

The Cartesian product of a countable infinity of copies of the interval [0,1]. It can be denoted [0,1]^(aleph_0) or [0,1]^omega, where aleph_0 and omega are the first ...

11 11 1 11 2 2 11 2 4 2 11 3 6 6 3 11 3 9 10 9 3 11 4 12 19 19 12 4 11 4 16 28 38 28 16 4 11 5 20 44 66 66 44 20 5 11 5 25 60 110 126 110 60 25 5 1 (1) Losanitsch's triangle ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

A prime-distance graph is a distance graph with distance set given by the set of prime numbers.

A subset E of a topological space S is said to be of first category in S if E can be written as the countable union of subsets which are nowhere dense in S, i.e., if E is ...

A subset E of a topological space S is said to be of second category in S if E cannot be written as the countable union of subsets which are nowhere dense in S, i.e., if ...