Prime Gaps In The Gaussian Integers

Kyle Bradford, James Taylor, George Volz

Published 2024-11-11Version 1

In this paper we create a definition for prime gaps in the Gaussian integers using a boxcar metric. From this we used numerical methods to derive an asymptotic upper bound for the gaps in this scenario, namely O(log^2|p_{n}|).