Catherine A. Buell and Eric W. Kimball

Notes on Number Theory and Discrete Mathematics, ISSN 1310-5132

Volume 20, 2014, Number 4, Pages 11—20

**Download full paper: PDF, 172 Kb**

## Details

### Authors and affiliations

Catherine A. Buell

*Department of Mathematics, Fitchburg State University
160 Pearl Street, Fitchburg, MA, 01420, USA
*

Eric W. Kimball

*Department of Mathematics, Bates College
3 Andrews Rd., Lewiston, ME, 04240, USA
*

### Abstract

An integer, *n*, is called a Frobenius probable prime with respect to a polynomial when it passes the Frobenius probable prime test. Composite integers that are Frobenius probable primes are called Frobenius pseudoprimes. Jon Grantham developed and analyzed a Frobenius probable prime test with quadratic polynomials. Using the Chinese Remainder Theorem and Frobenius automorphisms, we were able to extend Grantham’s results to some cubic polynomials. This case is computationally similar but more efficient than the quadratic case.

### Keywords

- Frobenius
- Pseudoprimes
- Cubic
- Number fields
- Primality

### AMS Classification

- 11Y11

### References

- Grantham, J. Frobenius Pseudoprimes, Mathematics of Computation, Vol. 234, 2000, 873–891.
- Grantham, J. A Probable Prime Test With High Confidence, Journal of Number Theory, Vol. 72, 1998, 32–47.

## Related papers

## Cite this paper

APABuell, C. A., & Kimball, E. W. (2014). Frobenius pseudoprimes and a cubic primality test. Notes on Number Theory and Discrete Mathematics, 20(4), 11-20.

ChicagoBuell, Catherine A., and Eric W. Kimball. “Frobenius Pseudoprimes and a Cubic Primality Test.” Notes on Number Theory and Discrete Mathematics 20, no. 4 (2014): 11-20.

MLABuell, Catherine A., and Eric W. Kimball. “Frobenius Pseudoprimes and a Cubic Primality Test.” Notes on Number Theory and Discrete Mathematics 20.4 (2014): 11-20. Print.