Weak Bertrand conjecture for Gaussian lines

Let LL be a primitive Gaussian line, and let αn\alpha_n denote the indexed Gaussian integers on LL. For β=x+iyZ[i]\beta=x+iy\in\mathbb{Z}[i], write N(β)N(\beta) for its Gaussian norm. Weak Bertrand conjecture for Gaussian lines. If n>1n>1, then there is always at least one Gaussian prime on LL lying between αn\alpha_n and αn+N(αn)\alpha_{n+N(\alpha_n)}. This is a norm-based analogue of Bertrand's postulate; the source explains that the norm interval may be more efficient than the ν\nu-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

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.