Search Results for ""

Bertrand's postulate, also called the Bertrand-Chebyshev theorem or Chebyshev's theorem, states that if n>3, there is always at least one prime p between n and 2n-2. ...

Brocard's conjecture states that pi(p_(n+1)^2)-pi(p_n^2)>=4 for n>=2, where pi(n) is the prime counting function and p_n is the nth prime. For n=1, 2, ..., the first few ...

The Riemann sphere C^*=C union {infty}, also called the extended complex plane. The notation C^^ is sometimes also used (Krantz 1999, p. 82). The notation C^* is also used to ...

The concatenation of two strings a and b is the string ab formed by joining a and b. Thus the concatenation of the strings "book" and "case" is the string "bookcase". The ...

Discrepancy is a measure of the deviation of a point set from a uniform distribution. In general, the computation of the discrepancy of a point set is computationally ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...

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

A factorization algorithm which works by expressing N as a quadratic form in two different ways. Then N=a^2+b^2=c^2+d^2, (1) so a^2-c^2=d^2-b^2 (2) (a-c)(a+c)=(d-b)(d+b). (3) ...

Let p_i denote the ith prime, and write m=product_(i)p_i^(v_i). Then the exponent vector is v(m)=(v_1,v_2,...).

The primes with Legendre symbol (n/p)=1 (less than N=pi(d) for trial divisor d) which need be considered when using the quadratic sieve factorization method.