A probable prime is a number satisfying Fermat's little theorem (or some other primality test) for some nontrivial base. A probable prime which is shown to be composite is called a pseudoprime; otherwise, it is a (true) prime. As of May 2024, the largest known probable primes are the repunit primes R_8177207 | = | (10^8177207 - 1)/9 R_5794777 | = | (10^5794777 - 1)/9 which have 8177207 and 5794777 decimal digits, respectively (Lifchitz and Lifchitz).
We guarantee you’ll find the right tutor, or we’ll cover the first hour of your lesson.