Sets of integers composed of few prime numbers
Jan Turk (1977-1978)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Similarity:
Jan Turk (1977-1978)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Similarity:
John Friedlander, Andrew Granville (1992)
Compositio Mathematica
Similarity:
R. Hall (1975)
Acta Arithmetica
Similarity:
Levieil, Eric, Luca, Florian, Shparlinski, Igor E. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
De Koninck, Jean-Marie, Luca, Florian (2005)
Integers
Similarity:
Kátai, Imre, Subbarao, M.V. (2005)
Mathematica Pannonica
Similarity:
Loomis, Paul, Luca, Florian (2008)
Integers
Similarity:
Florian Luca, Igor E. Shparlinski (2007)
Colloquium Mathematicae
Similarity:
We show that if a > 1 is any fixed integer, then for a sufficiently large x>1, the nth Cullen number Cₙ = n2ⁿ +1 is a base a pseudoprime only for at most O(x log log x/log x) positive integers n ≤ x. This complements a result of E. Heppner which asserts that Cₙ is prime for at most O(x/log x) of positive integers n ≤ x. We also prove a similar result concerning the pseudoprimality to base a of the Woodall numbers given by Wₙ = n2ⁿ - 1 for all n ≥ 1.
Sándor, József, Tóth, László (2008)
Integers
Similarity:
Luca, Florian (2003)
Novi Sad Journal of Mathematics
Similarity:
Baoulina, Ioulia, Luca, Florian (2008)
Annales Mathematicae et Informaticae
Similarity:
K. Győry, A. Sárközy, C. L. Stewart (1996)
Acta Arithmetica
Similarity: