Frobenius Pseudoprime

Let be a Monic Polynomial of degree with discriminant . Then an Odd Integer with is called a Frobenius pseudoprime with respect to if it passes a certain algorithm given by Grantham(1996). A Frobenius pseudoprime with respect to a Polynomial is then a composite Frobenius probablyprime with respect to the Polynomial .

While 323 is the first Lucas Pseudoprime with respect to the Fibonacci polynomial , the first Frobeniuspseudoprime is 5777. If , then any Frobenius pseudoprime with respect to is also a PerrinPseudoprime. Grantham (1997) gives a test based on Frobenius pseudoprimes which is passed by CompositeNumbers with probability at most 1/7710.

References

Grantham, J. ``Frobenius Pseudoprimes.'' 1996. http://www.clark.net/pub/grantham/pseudo/pseudo1.ps

Grantham, J. ``A Frobenius Probable Prime Test with High Confidence.'' 1997. http://www.clark.net/pub/grantham/pseudo/pseudo2.ps

Grantham, J. ``Pseudoprimes/Probable Primes.'' http://www.clark.net/pub/grantham/pseudo/.

• Fermat's Little Theorem
• Fermat's Little Theorem Converse
• Fermat Spiral Inverse Curve
• Fermat's Polygonal Number Theorem
• Fermat's Primality Test
• Fermat's Problem
• Fermat's Right Triangle Theorem
• Fermat's Sigma Problem
• Fermat's Simple Theorem
• Fermat's Spiral
• Fermat's Theorem
• Fermat's Two-Square Theorem
• Fermat Sum Theorem
• Fermi-Dirac Distribution
• Fern
• Ferrari's Identity
• Ferrers Diagram
• Ferrers' Function
• Ferrier's Prime
• Feuerbach Circle
• Feuerbach Point
• Feuerbach's Conic Theorem
• Feuerbach's Theorem
• Feynman Point
• FFT