Only 17% of all 64-bit Integers are products of two 32-bit integers
chmaynard
12 points
2 comments
May 22, 2026
Related Discussions
Found 5 related stories in 72.3ms across 8,303 title embeddings via pgvector HNSW
- Generating All 32-Bit Primes (Part I) hnlyman · 80 pts · March 15, 2026 · 53% similar
- Optimization of 32-bit Unsigned Division by Constants on 64-bit Targets mpweiher · 51 pts · April 12, 2026 · 48% similar
- C Bit-Field Pitfalls fanf2 · 26 pts · March 21, 2026 · 40% similar
- No way to parse integers in C (2022) konmok · 74 pts · May 20, 2026 · 40% similar
- Quantum Computers Are Not a Threat to 128-Bit Symmetric Keys hasheddan · 188 pts · April 20, 2026 · 39% similar
Discussion Highlights (2 comments)
Someone
Human intuition often is very bad for this kind of question. For example, for n=2⁶⁴, there are about 4×10¹⁷ primes and about 4×10⁹ squares less than n.
karmakaze
Well that led me down an unexpected rabbit hole. I happened to be looking for ways to subset scatter-gather queries in a distributed database using composite hash keys and this seemed relevant. Grid partitioning (or multi-dimensional indexing) I knew of, but then also found Morton Z-Ordering (Bit-Interleaving), Coprime Matrix Multiplication (Lattice Hashing), Locality-Sensitive Hashing (LSH) / Random Projections and its relation to perceptual hashing. Then I realized it's on Daniel Lemire's blog which is very fitting. Thanks HN.