ON THE LARGEST PRIME FACTOR OF THE MERSENNE NUMBERS

DOI10.1017/S0004972709000033zbMath1178.11061arXiv0704.1327OpenAlexW1990905907MaRDI QIDQ3633334

Kevin Ford, Florian Luca, Igor E. Shparlinski

Publication date: 18 June 2009

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0704.1327

zbMATH Keywords

primesMersenne numbersapplications of sieve methods

Mathematics Subject Classification ID

Applications of sieve methods (11N36) Distribution of integers with specified multiplicative constraints (11N25)

Related Items (8)

Unnamed Item ⋮ Chen's conjecture and its generalization ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Fourier duality for fractal measures with affine scales ⋮ Spectral measures and Cuntz algebras ⋮ On Prime Factors of Terms of Linear Recurrence Sequences ⋮ On the composition of a certain arithmetic function

Cites Work

• Unnamed Item
• Unnamed Item
• Integers with dense divisors. I
• On a problem of Oppenheim concerning Factorisatio Numerorum
• Integers without large prime factors
• On Divisors of Fermat, Fibonacci, Lucas, and Lehmer Numbers

This page was built for publication: ON THE LARGEST PRIME FACTOR OF THE MERSENNE NUMBERS