On the number of prime factors of integers of the form ab + 1
K. Győry, A. Sárközy, C. L. Stewart (1996)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
K. Győry, A. Sárközy, C. L. Stewart (1996)
Acta Arithmetica
Similarity:
Jan Turk (1977-1978)
Séminaire Delange-Pisot-Poitou. Théorie des nombres
Similarity:
De Koninck, Jean-Marie, Luca, Florian (2005)
Integers
Similarity:
R. Tijdeman (1973)
Compositio Mathematica
Similarity:
P. Erdös, T. Shorey (1976)
Acta Arithmetica
Similarity:
Levieil, Eric, Luca, Florian, Shparlinski, Igor E. (2005)
International Journal of Mathematics and Mathematical Sciences
Similarity:
T. N. Shorey, R. Tijdeman (1976)
Compositio Mathematica
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.
Luca, Florian (2003)
Novi Sad Journal of Mathematics
Similarity:
R. Hall (1975)
Acta Arithmetica
Similarity: