Search Results for ""

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

An entire function f is said to be of finite order if there exist numbers a,r>0 such that |f(z)|<=exp(|z|^a) for all |z|>r. The infimum of all numbers a for which this ...

A negative integer is one of the integers ..., -4, -3, -2, -1 obtained by negating the positive integers. The negative integers are commonly denoted Z^-.

Let n be an elliptic pseudoprime associated with (E,P), and let n+1=2^sk with k odd and s>=0. Then n is a strong elliptic pseudoprime when either kP=0 (mod n) or 2^rkP=0 (mod ...

Five point geometry is a finite geometry subject to the following three axioms: 1. there exist exactly five points, 2. each two distinct points have exactly one line on both ...

For a nonzero real number r and a triangle DeltaABC, swing line segment BC about the vertex B towards vertex A through an angle rB. Call the line along the rotated segment L. ...

The Landau-Mignotte bound, also known as the Mignotte bound, is used in univariate polynomial factorization to determine the number of Hensel lifting steps needed. It gives ...

There are several conflicting meanings associated with the notation lgx. In German and Russian literature, the notation lgx is used to mean the common logarithm log_(10)x. ...

In number theory (e.g., Ivić 2003), the symbol log_kx is commonly used to mean the nested logarithm (also called the repeated logarithm or iterated logarithm) ...

Three point geometry is a finite geometry subject to the following four axioms: 1. There exist exactly three points. 2. Two distinct points are on exactly one line. 3. Not ...