Tag Archives: testing

Fast and slow machines

Posted on January 27, 2018 by Brent

In my previous post, I presented three hypothetical machines which take a positive integer as input and give us something else as output: a factorization machine gives us the complete prime factorization of ; a factor machine gives us one … Continue reading →

Posted in computation, number theory, primes | Tagged , , , , , , , , , , | 1 Comment

New Mersenne prime

Posted on January 11, 2018 by Brent

With impeccable timing, just in the middle of my series about primality testing, a new Mersenne prime has been announced, a little under two years after the previous one. In particular, it has been shown that is prime; this is … Continue reading →

Posted in number theory, primes | Tagged , , , , | Comments Off on New Mersenne prime

A tale of three machines

Posted on January 3, 2018 by Brent

The Fundamental Theorem of Arithmetic tells us that any positive integer can be factored into a product of prime factors.1 Given a positive integer , this leads naturally to several questions: What is the prime factorization of ? This is … Continue reading →

Posted in computation, number theory, primes | Tagged , , , , | 11 Comments