Prime Numbers with a Fixed Number of One Bits or Zero Bits in Their Binary Representation

DOI10.1080/10586458.2001.10504447zbMath1046.11089OpenAlexW2090394116MaRDI QIDQ4736654

Samuel S. jun. Wagstaff

Publication date: 5 August 2004

Published in: Experimental Mathematics (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.em/999188636

Mathematics Subject Classification ID

Other number representations (11A67) Primes (11A41) Primality (11Y11)

Related Items

ALMOST ALL PRIMES HAVE A MULTIPLE OF SMALL HAMMING WEIGHT ⋮ On the generating functions of Mersenne and Fermat primes

Cites Work

• Sums of digits and almost primes
• Almost primes whose expansion in base \(r\) misses some digits
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Unnamed Item
• Unnamed Item