Search Results for ""

If a number fails Miller's primality test for some base a, it is not a prime. If the number passes, it may be a prime. A composite number passing Miller's test is called a ...

A number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime ...

The W-polynomials obtained by setting p(x)=3x and q(x)=-2 in the Lucas polynomial sequence. The first few Fermat polynomials are F_1(x) = 1 (1) F_2(x) = 3x (2) F_3(x) = ...

The Jacobsthal polynomials are the W-polynomial obtained by setting p(x)=1 and q(x)=2x in the Lucas polynomial sequence. The first few Jacobsthal polynomials are J_1(x) = 1 ...

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 Pell polynomials P(x) are the W-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. This gives recursive equations for P(x) from ...

Let N be an odd integer, and assume there exists a Lucas sequence {U_n} with associated Sylvester cyclotomic numbers {Q_n} such that there is an n>sqrt(N) (with n and N ...

The hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...

Find a way to stack a square of cannonballs laid out on the ground into a square pyramid (i.e., find a square number which is also square pyramidal). This corresponds to ...

The Jacobsthal numbers are the numbers obtained by the U_ns in the Lucas sequence with P=1 and Q=-2, corresponding to a=2 and b=-1. They and the Jacobsthal-Lucas numbers (the ...