## You are here

Homeprobable prime

## Primary tabs

# probable prime

A sufficiently large odd integer $q$ believed to be a prime number because it has passed some preliminary primality test relative to a given base, or a pattern suggests it might be prime, but it has not yet been subjected to a conclusive primality test.

For primes with no specific form, it is required to test every potential prime factor $p<\sqrt{q}$ to be absolutely sure that $q$ is in fact a prime. For Mersenne probable primes, the Lucas-Lehmer test is accepted as a conclusive primality test.

Once a probable prime is conclusively shown to be a prime, it of course loses the label ”probable.” It also loses it if conclusively shown to be composite, but in that case it might then be called a pseudoprime relative to base $a$.

Type of Math Object:

Definition

Major Section:

Reference

## Mathematics Subject Classification

11A41*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections