Search Results for ""

A prime factorization algorithm in which a sequence of trial divisors is chosen using a quadratic sieve. By using quadratic residues of N, the quadratic residues of the ...

Legendre's formula counts the number of positive integers less than or equal to a number x which are not divisible by any of the first a primes, (1) where |_x_| is the floor ...

Legion's number of the first kind is defined as L_1 = 666^(666) (1) = 27154..._()_(1871 digits)98016, (2) where 666 is the beast number. It has 1881 decimal digits. Legion's ...

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

Lehmer (1938) showed that every positive irrational number x has a unique infinite continued cotangent representation of the form x=cot[sum_(k=0)^infty(-1)^kcot^(-1)b_k], (1) ...

The Lehmer mean of a set of n numbers {a_k}_(k=1)^n is defined by L_p(a_1,...,a_n)=(sum_(k=1)^(n)a_k^p)/(sum_(k=1)^(n)a_k^(p-1)) (Havil 2003, p. 121).

A Lehmer number is a number generated by a generalization of a Lucas sequence. Let alpha and beta be complex numbers with alpha+beta = sqrt(R) (1) alphabeta = Q, (2) where Q ...

The Lehmer cotangent expansion for which the convergence is slowest occurs when the inequality in the recurrence equation b_k>=b_(k-1)^2+b_(k-1)+1. (1) for ...

Lehmer's formula is a formula for the prime counting function, pi(x) = (1) where |_x_| is the floor function, a = pi(x^(1/4)) (2) b = pi(x^(1/2)) (3) b_i = pi(sqrt(x/p_i)) ...

An unsolved problem in mathematics attributed to Lehmer (1933) that concerns the minimum Mahler measure M_1(P) for a univariate polynomial P(x) that is not a product of ...