On the Sum of a Prime and a Number that is not Square-Free
Ethan S. Lee, Rowan O'Clarey

TL;DR
The paper proves that large integers can be expressed as the sum of a prime and a non-square-free number, with unconditional results for odd integers and conditional results under GRH.
Contribution
It establishes the sum representation for large integers with new unconditional and conditional proofs, advancing understanding of additive number theory.
Findings
Unconditionally holds for odd n > 24.
Under GRH, holds for all n > 24.
Discusses obstructions to unconditional proof for all n > 24.
Abstract
We prove that every sufficiently large integer can be written as the sum of a prime and an integer that is not square-free. In addition, we expect this result holds for every and prove two results to support this claim. First, we prove the result holds unconditionally for every odd . Second, assuming the Generalised Riemann Hypothesis for Dirichlet -functions, we prove the result holds for every . We also discuss the obstruction which prohibits us from proving the result unconditionally for every .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
