Papers

• The Largest Prime Divisor of the Maximal Order of an Element of S_n, Mathematics of Computation 64 (1995), 407-410. arXiv:1903.06817
  
• A Probable Prime Test with High Confidence, J. Number Theory 72 (1998), 32-47. arXiv: 1903.06823
  
• Frobenius Pseudoprimes, Mathematics of Computation 70 (2001), 873-891. arXiv:1903.06820
• There Are Infinitely Many Perrin Pseudoprimes, J. Number Theory 130, (2010), 1117-1128. arXiv:1903.06825
• (with W.R. Alford, Steven Hayman, and Andrew Shallue), Constructing Carmichael numbers through improved subset-product algorithms, Mathematics of Computation 83 (2014), 899–915. arXiv:1203.6664
• (with Witold Jarnicki, John Rickert, and Stan Wagon), Repeatedly Appending Any Digit to Generate Composite Numbers, American Mathematical Monthly 121 (2014), 416-421. arXiv:1903.05023
• An unconditional improvement to the running time of the quadratic Frobenius test. J. Number Theory 210 (2020), 476–480. arXiv:1908.02394
  
• (with Hester Graves), Brazilian primes which are also Sophie Germain primes. Integers 20 (2020), Paper No. A32. arXiv:1903.04577
• (with Xander Faber), Binary Curves of small fixed genus and gonality with many rational points. Submitted for publication. arXiv:2005.07054 
• (with Hester Graves), The abc Conjecture Implies That Only Finitely Many Cullen Numbers Are Repunits. Submitted for publication. arXiv:2009.04052