A binary additive equation with prime and square-free number

Abstract

Let [\, ·\,] be the floor function. In this paper, we show that when 1<c<8279, then every sufficiently large positive integer N can be represented in the form equation* N=[pc]+[mc]\,, equation* where p is a prime and m is a square-free.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…