On an additive problem involving fractional powers with one prime and an almost prime variables
Abstract
For any real number t, let [t] denote the integer part of t. In this paper it is proved that if 1<c<247238, then for sufficiently large integer N, the equation \[[pc]+[mc]=N\] has a solution in a prime p and an almost prime m with at most [450247-238c]+1 prime factors. This result constitutes an improvement upon that of Petrov and Tolev.
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.