| Information | |
|---|---|
| has gloss | eng: In mathematics, particularly number theory, a probable prime is a whole number that is likely to be prime by having passed a probabilistic test such as Fermat's primality test. Probable primes may be composite, but the tests are designed so they are really unlikely to be composite. These probabilistic tests are easier to do than tests that actually guarantee primality, and the composite probable primes are useful too in encryption that uses prime numbers. |
| has gloss | eng: In number theory, a probable prime (PRP) is an integer that satisfies a specific condition also satisfied by all prime numbers. Different types of probable primes have different specific conditions. While there may be probable primes that are composite (called pseudoprimes), the condition is generally chosen in order to make such exceptions rare. |
| lexicalization | eng: Probable primes |
| lexicalization | eng: probable prime |
| lexicalization | eng: Strong Composite |
| instance of | (noun) an integer that has no integral factors but itself and 1 prime number |
| Meaning | |
|---|---|
| French | |
| has gloss | fra: En Arithmétique modulaire, un nombre premier probable (NPP) est un entier qui satisfait à une condition qui est satisfaite aussi par tous les nombres premiers. Ces nombres premiers probables peuvent être composés (appelés pseudopremiers), ils sont rares, dépendants du test utilisé. |
| lexicalization | fra: Nombre Premier Probable |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint