Mathematics · the experiment
Hunt for Carmichael numbers of the form 2ⁿ × p³ + 1
Your machine applies Korselt's criterion to the numbers 2ⁿ × p³ + 1: it splits them into primes and tests each one. Set n, sweep other values of p, change the exponent of 3, and recover what the paper proves.
1 · Find 1729 again
Beginner
According to the article, when is 2ⁿ × p³ + 1, with p prime, a Carmichael number?
Check it with p = 3: set n until N passes Korselt's criterion.
2 · The possible factors
Intermediate
The first step of the proof restricts the possible factors. Which of these primes remains a candidate for a Carmichael number 27 × 2ⁿ + 1?
3 · What if p is not 3?
Intermediate
Take p = 5 and n = 6: N = 2⁶ × 5³ + 1 = 8001. What can you say without factoring it?
4 · Another family
Expert
46657 = 2⁶ × 3⁶ + 1 is a Carmichael number. Why does it not contradict the paper's result?
Now change the exponent of 3 as well, with p = 3: find a Carmichael number other than 1729.
Hunt complete
—