PrimeQCertificateCheck

gives True if cert is a valid certificate for the primality or compositeness of n, and False otherwise.

Details and Options

To use PrimeQCertificateCheck, you first need to load the Primality Proving Package using Needs["PrimalityProving`"].
PrimeQCertificateCheck recognizes whether cert is a primality or compositeness certification, and then uses the certificate to verify the assertion.
The certificate cert should match the integer n.

Wolfram Language code: Needs["PrimalityProving`"]

A certificate of primality:

Wolfram Language code: PrimeQCertificate[1093]

Check:

Wolfram Language code: PrimeQCertificateCheck[%, 1093]

Wolfram Language code: Needs["PrimalityProving`"]

A certificate of compositeness:

Wolfram Language code: PrimeQCertificate[3837523]

Check:

Wolfram Language code: PrimeQCertificateCheck[%, 3837523]

Wolfram Language code: Needs["PrimalityProving`"]

A certificate need not come from PrimeQCertificate. Here is the certificate generated by PrimeQCertificate for 3837523:

Wolfram Language code: c1 = PrimeQCertificate[3837523]

A different certificate asserting that 3837523 is composite:

Wolfram Language code: c2 = {1488665, 2, 3837523}

Check:

Wolfram Language code: PrimeQCertificateCheck[c2, 3837523]

Top