Prime Quadruplets and Jump Conditions on Arithmetic Functions
Abstract
We provide progress on the characterization of composite integers n that satisfy the jump conditions φ(n+12)=φ(n)+12 and σ(n+12)=σ(n)+12 simultaneously. While it is known that prime quadruplets (p,p+2,p+6,p+8) generate solutions n=p(p+8), the complete characterization remains an open conjecture. We prove that this characterization is complete when n and n+12 are both squarefree semiprimes, and that no solutions can be composed of a single prime power. Furthermore, a complete search up to 1012 resulted in no counterexamples to the conjecture. If this conjecture is proven true, and there are infinitely many such solutions, then it can be proved that there are infinitely many prime quadruplets.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.