Search Results for ""

A Shanks (a,b)-chain is a sequence of primes p_i of the form p_(i+1)=ap_i^2-b, with a and b integers. On Sep. 1, 2000, P. Leyland found a (4, 17)-chain of length 6, and on ...

The minimal polynomial S_n(x) whose roots are sums and differences of the square roots of the first n primes, ...

A number N=p_1p_2...p_n where the p_is are distinct primes and n>=3 such that p_i=Ap_(i-1)+B (1) for i=1, 2, ..., n, p_0 taken as 1, and with A and B some fixed integers. For ...

An integer j(n) is called a jumping champion if j(n) is the most frequently occurring difference between consecutive primes <=n (Odlyzko et al. 1999). This term was coined by ...

The decimal expansion of the natural logarithm of 2 is given by ln2=0.69314718055994530941... (OEIS A002162). It was computed to 10^(11) decimal digits by S. Kondo on May 14, ...

Informally, a function f is a one-way function if 1. The description of f is publicly known and does not require any secret information for its operation. 2. Given x, it is ...

The sequence defined by e_0=2 and the quadratic recurrence equation e_n=1+product_(i=0)^(n-1)e_i=e_(n-1)^2-e_(n-1)+1. (1) This sequence arises in Euclid's proof that there ...

An apodization function (also called a tapering function or window function) is a function used to smoothly bring a sampled signal down to zero at the edges of the sampled ...

A path in a graph G is a subgraph of G that is a path graph (West 2000, p. 20). The length of a path is the number of edges it contains. In most contexts, a path must contain ...

The radius of a polygon's incircle or of a polyhedron's insphere, denoted r or sometimes rho (Johnson 1929). A polygon possessing an incircle is same to be inscriptable or ...