EUDML | Primitive Lucas d-pseudoprimes and Carmichael-Lucas numbers

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Primitive Lucas d-pseudoprimes and Carmichael-Lucas numbers”

Primitive prime divisors in polynomial arithmetic dynamics.

Rice, Brian (2007)

Integers

Similarity:

Classifying Lehmer triples

Robert Juricevic (2009)

Acta Arithmetica

Similarity:

Primitive prime factors in second-order linear recurrence sequences

Andrew Granville (2012)

Acta Arithmetica

Similarity:

Simultaneous Pellian equations with a single or no solution

Alain Togbé, Bo He (2008)

Acta Arithmetica

Similarity:

On some special forms of simultaneous Pell equations

Zhigang Li, Jianye Xia, Pingzhi Yuan (2007)

Acta Arithmetica

Similarity:

Primitive quadratics reflected in $B_{2}$ -sequences.

Lindström, B. (1999)

Portugaliae Mathematica

Similarity:

On superpseudoprimes

Lawrence Somer (2004)

Mathematica Slovaca

Similarity:

A necessary and sufficient condition for the primality of Fermat numbers

Michal Křížek, Lawrence Somer (2001)

Mathematica Bohemica

Similarity:

We examine primitive roots modulo the Fermat number $F_{m} = 2^{2^{m}} + 1$ . We show that an odd integer $n \geq 3$ is a Fermat prime if and only if the set of primitive roots modulo $n$ is equal to the set of quadratic non-residues modulo $n$ . This result is extended to primitive roots modulo twice a Fermat number.

On Lucas pseudoprimes of the form $a x^{2} + b x y + c y^{2}$ in arithmetic progression $A X + B$ with a prescribed value of the Jacobi symbol

Andrzej Rotkiewicz (2002)

Acta Mathematica et Informatica Universitatis Ostraviensis

Similarity: