Prime Gaps In The Gaussian Integers
Abstract
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(log2|pn|).
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.