Weak Bertrand conjecture for Gaussian lines
Weak Bertrand conjecture for Gaussian lines
Let be a primitive Gaussian line, and let denote the indexed Gaussian integers on . For , write for its Gaussian norm. Weak Bertrand conjecture for Gaussian lines. If , then there is always at least one Gaussian prime on lying between and . This is a norm-based analogue of Bertrand's postulate; the source explains that the norm interval may be more efficient than the -interval for searching for Gaussian primes, but gives no resolution.
Sources & referencesView supporting material
Primary source
Elsa Magness, Brian Nugent and Leanne Robertson, “Walking to infinity on gaussian lines”, arXiv:2001.05018 (2020).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.