The following pages link to Jon Grantham (Q971843):
Displayed 20 items.
- There are infinitely many Perrin pseudoprimes (Q971844) (← links)
- A probable prime test with high confidence (Q1273196) (← links)
- Binary curves of small fixed genus and gonality with many rational points (Q2075925) (← links)
- An unconditional improvement to the running time of the quadratic Frobenius test (Q2291718) (← links)
- Frobenius pseudoprimes (Q2701573) (← links)
- Constructing Carmichael numbers through improved subset-product algorithms (Q2871190) (← links)
- Repeatedly Appending Any Digit to Generate Composite Numbers (Q2928637) (← links)
- (Q3390089) (← links)
- Brazilian Primes Which Are Also Sophie Germain Primes (Q3390710) (← links)
- The Largest Prime Dividing the Maximal Order of an Element of S n (Q4325739) (← links)
- The abc Conjecture Implies That Only Finitely Many s-Cullen Numbers Are Repunits (Q4989365) (← links)
- (Q5887606) (← links)
- (Q5887785) (← links)
- Ternary and Quaternary Curves of Small Fixed Genus and Gonality With Many Rational Points (Q6112172) (← links)
- Binary Curves of small fixed genus and gonality with many rational points (Q6340713) (← links)
- On Integers Whose Sum is the Reverse of their Product (Q6376391) (← links)
- Finding a Widely Digitally Delicate Prime (Q6377172) (← links)
- Only finitely many $s$-Cullen numbers are repunits for a fixed $s\ge 2$ (Q6385207) (← links)
- Representing integers as a sum of three cubes (Q6418093) (← links)
- Fibonacci primes, primes of the form $2^n-k$ and beyond (Q6443897) (← links)