Representing positive integers as a sum of a squarefree number and a small prime
Ognian Trifonov, Jack Dalton

TL;DR
This paper proves that almost all positive integers can be expressed as the sum of a squarefree number and a small prime, with only a few exceptions, advancing understanding of additive number theory.
Contribution
It establishes a new representation theorem for positive integers involving squarefree numbers and small primes, identifying specific exceptions.
Findings
Almost all positive integers are representable as a squarefree number plus a small prime.
Identifies a finite set of exceptions that cannot be represented in this form.
Provides a new perspective on additive decompositions involving squarefree numbers and primes.
Abstract
We prove that every positive integer which is not equal to , , , , , , , or can be represented as a sum of a squarefree number and a prime not exceeding .
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.
Taxonomy
TopicsAnalytic Number Theory Research · Computability, Logic, AI Algorithms · History and Theory of Mathematics
