On the Sum of a Prime and a Number that is not Square-Free
Abstract
We prove that every sufficiently large integer n 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 n > 24 and prove two results to support this claim. First, we prove the result holds unconditionally for every odd n > 24. Second, assuming the Generalised Riemann Hypothesis for Dirichlet L-functions, we prove the result holds for every n > 24. We also discuss the obstruction which prohibits us from proving the result unconditionally for every n > 24.
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.