Deterministic Primality Testing for Limited Bit Width
Summary
The article presents a deterministic Miller-Rabin primality test for 32-bit integers using bases 2, 3, 5, and 7, with accompanying discussion of historical context and practical considerations. It explains strong pseudoprimes, references key papers and datasets, and compares deterministic Miller-Rabin to sieve-based methods in terms of performance, including a GitHub link to the code.