Papers
Topics
Authors
Recent
Search
2000 character limit reached

On an additive problem involving fractional powers with one prime and an almost prime variables

Published 3 Jun 2023 in math.NT | (2306.01972v2)

Abstract: For any real number $t$, let $[t]$ denote the integer part of $t$. In this paper it is proved that if $1<c<\frac{247}{238}$, then for sufficiently large integer $N$, the equation [\left[p{c}\right]+\left[m{c}\right]=N] has a solution in a prime $p$ and an almost prime $m$ with at most $\left[\frac{450}{247-238c}\right]+1$ prime factors. This result constitutes an improvement upon that of Petrov and Tolev.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.