Jon Grantham

most citedA Probable Prime Test With High Confidence

34 citations · 52 across the 3 of their papers we have counts for

collaborators

3 papers

math.NT2019★ 18 cited

There are Infinitely Many Perrin Pseudoprimes

Jon Grantham

This paper proves the existence of infinitely many Perrin pseudoprimes, as conjectured by Adams and Shanks in 1982. The theorem proven covers a general class of pseudoprimes based…

math.NT2019★ 34 cited

A Probable Prime Test With High Confidence

Jon Grantham

Monier and Rabin proved that an odd composite can pass the Strong Probable Prime Test for at most $\frac{1}{4}$ of the possible bases. In this paper, a probable prime test is develope…

math.NT2019

Repeatedly Appending Any Digit to Generate Composite Numbers

Jon Grantham, Witold Jarnicki, John Rickert +1

We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that…