We prove that every integer greater than two may be written as the sum of a prime and a square-free number.
On the sum of a prime and a square-free number with divisibility conditions
On the representation of integer as sum of a square-free number and a prime of special type
Multiplicative functions commutable with sums of squares
![QR code for arXiv:1410.7459 [math.NT]](http://oss.arxitics.com/images/favicon.svg)