David Slowinski

David Slowinski is an American mathematician noted for his work on Mersenne primes, the special prime numbers of the form 2^p - 1. Public sources identify him with the discovery of several then-record Mersenne primes from the late 1970s through the 1990s, making him a familiar name in computational number theory.

He is especially associated with large-scale computer searches and collaborations that tested the limits of available hardware and algorithms. His name is also attached to writing on the subject, including The 32nd Mersenne Prime Predicted by Mersenne, which reflects the same clear focus on big prime-number discoveries that shaped his reputation.

Although not much biographical detail is readily available in the sources I could confirm, his mathematical achievements stand out on their own. For readers drawn to the drama of pure math and computation working together, his career offers a glimpse into how major discoveries can come from patience, programming, and a fascination with enormous numbers.