On the Sum of a Prime and a Square-free Number
Adrian Dudek

TL;DR
This paper proves that every integer greater than two can be expressed as the sum of a prime and a square-free number, extending our understanding of additive number theory.
Contribution
It establishes a new universal representation theorem for integers as sums of primes and square-free numbers, a previously unproven conjecture.
Findings
Every integer > 2 can be written as prime + square-free number
The result holds for all integers greater than two
Provides a new perspective on additive number theory
Abstract
We prove that every integer greater than two may be written as the sum of a prime and a square-free number.
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 · Limits and Structures in Graph Theory · History and Theory of Mathematics
