2 citations · 3 across the 11 of their papers we have counts for
12 papers
Sizes of Pre-Images of the Minimal Euclidean Function on the Gaussian Integers
Hester Graves
In 2023, the author presented the first computable minimal Euclidean function for a non-trivial number field. Along with a formula for , the minimal Euclidean fu…
The abc conjecture implies infinitely many non-Wieferich places for fixed bases in number fields
Hester Graves, Benjamin Weiss
Silverman showed that, assuming the conjecture, there are non-Wieferich primes base less than \cite{silverman}, for all non-zero . This inspired Grave…
A Division Algorithm for the Gaussian Integers' Minimal Euclidean Function
Hester Graves
The usual division algorithms on and measure the size of remainders using the norm function. These rings are Euclidean with respect to several function…
Primes of the Form and Goldbach's `Other Other' Conjecture
Jon Grantham, Hester Graves
We compute all primes up to of the form . Calculations using this list verify, up to our bound, a less famous conjecture of Goldbach. We introduce `Gold…
An Elementary Proof of the Minimal Euclidean Function on the Gaussian Integers
Hester Graves
Every Euclidean domain has a minimal Euclidean function, . A companion paper \cite{Graves} introduced a formula to compute . It is the first formula for…
Only finitely many -Cullen numbers are repunits for a fixed
Michael Filaseta, Jon Grantham, Hester Graves
We show that for any integer , there are only finitely many -Cullen numbers that are repunits. More precisely, for fixed , there are only finitely many intege…
The Minimal Euclidean Function on the Gaussian Integers
Hester Graves
In 1949, Motzkin proved that every Euclidean domain has a minimal Euclidean function, . He showed that when , the minimal function is $ϕ_{\mathbb{Z}}(x) =…
The abc Conjecture Implies That Only Finitely Many s-Cullen Numbers Are Repunits
Jon Grantham, Hester Graves
Assuming the abc conjecture with , we use elementary methods to show that only finitely many -Cullen numbers are repunits, aside from two known infinite families. More pr…
Brazilian Primes Which Are Also Sophie Germain Primes
Jon Grantham, Hester Graves
We disprove a conjecture of Schott that no Brazilian primes are Sophie Germain primes. We enumerate all counterexamples up to .
The Minimal Euclidean Function on the Gaussian Integers
Hester Graves
The Minimal Euclidean Function on the Gaussian Integers
Growth Results and Euclidean Ideals
Hester Graves
Lenstra's concept of Euclidean ideals generalizes the Euclidean algorithm; a domain with a Euclidean ideal has cyclic class group, while a domain with a Euclidean algorithm has tri…
Euclidean Ideals in Quadratic Imaginary Fields
Hester Graves, Nick Ramsey
We classify all quadratic imaginary number fields that have a Euclidean ideal class. There are seven of them, they are of class number at most two, and in each case the unique clas…