Tag Archives: recognize

Quickly recognizing primes less than 1000: memorizing exceptional composites

Posted on October 15, 2018 by Brent

In my previous post I wrote about a procedure for testing the primality of any number less than : Test for divisibility by all primes up to , and also . (In practice I test for 2 and 5 first, … Continue reading →

Posted in arithmetic, computation, primes | Tagged , , , , , , , | Comments Off on Quickly recognizing primes less than 1000: memorizing exceptional composites

Quickly recognizing primes less than 1000: divisibility tests

Posted on October 11, 2018 by Brent

I took a little hiatus from writing here since I attended the International Conference on Functional Programming, and since then have been catching up on teaching stuff and writing a bit on my other blog. I gave a talk at … Continue reading →

Posted in arithmetic, computation, primes | Tagged , , , , | 3 Comments

Quickly recognizing primes less than 100

Posted on September 16, 2018 by Brent

Recently, Mark Dominus wrote about trying to memorize all the prime numbers under . This is a cool idea, but it made me start thinking about alternative: instead of memorizing primes, could we memorize a procedure for determining whether a … Continue reading →

Posted in arithmetic, computation, primes | Tagged , , , | 18 Comments