相关论文: On an additive problem involving fractional powers…

In this paper we consider the equation $[p^{c}] + [m^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{29}{28}$, then it has a solution in a prime $p$ and an almost prime $m$ with at most $\left[…

We consider the equation $[p_{1}^{c}] + [p_{2}^{c}] + [p_{3}^{c}] = N$, where $N$ is a sufficiently large integer, and prove that if $1 < c < \frac{17}{16}$, then it has a solution in prime numbers $p_{1}$, $p_{2}$, $p_{3}$ such that each…

We study the solubility of the binary additive equation $[m^c] + [p^c] = n$, where $m$ is an integer, $p$ is a prime number, and $c$ is a fixed real number in the range $1 < c < 3/2$.

Let $[\, \cdot\,]$ be the floor function. In this paper, we show that when $1<c<37/36$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c_1]+[p^c_2]+[p^c_3]\,, \end{equation*} where…

Let $1<c<\frac{1787}{1502}$ and $N$ be a sufficiently large real number. In this paper, it is proved that for any arbitrarily large number $E>0$ and for almost all real $R \in (N,2N]$, the Diophantine inequality…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that, for $12\leqslant b\leqslant 35$ and for every sufficiently large odd integer $N$, the equation…

Let N be a large enough natural number, A and B be subsets of {N+1, ... , 2N}. In this paper, we prove that there exists integers a, b with a belongs to A, b belongs to B such that ab=P_k^2 + O(P_k^{1-c}), where 0<c<1/2 and P_k denotes an…

We consider the Diophantine inequality \[ \left| p_1^{c} + p_2^{c} + p_3^c- N \right| < (\log N)^{-E} , \] where $1 < c < \frac{15}{14}$, $N$ is a sufficiently large real number and $E>0$ is an arbitrarily large constant. We prove that the…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for every sufficiently large even integer $N$, the equation \begin{equation*}…

Let $[\, \cdot\,]$ be the floor function. In this paper, we prove that when $1<c<\frac{16559}{15276}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c_1]+[p^c_2]+[p^c_3]\,,…

Let $[x]$ denote the integral part of the real number $x$, and $N$ be a sufficiently large integer. In this paper, it is proved that, for $1<c<\frac{4109054}{1999527}, c\not=2$, the Diophantine equation…

Let $${\mathbb P}^c=(\lfloor p^c\rfloor)_{p\in{\mathbb P}} \qquad (c>1,\ c\not\in {\mathbb N}), $$ where ${\mathbb P}$ is the set of prime numbers, and $\lfloor\cdot\rfloor$ is the floor function. We show that for every such $c$ there are…

Suppose that $1<c<9/8$. For any $m\geq 1$, there exist infinitely many $n$ such that $$ \{[n^c],\ [(n+1)^c],\ \ldots,\ [(n+k_0)^c]\} $$ contains at least $m+1$ primes, if $k_0$ is sufficiently large (only depending on $m$).

In this paper we introduce a new diophantine equation with prime numbers. Let $[\, \cdot\,]$ be the floor function. We prove that when $1<c<\frac{23}{21}$ and $\theta>1$ is a fixed, then every sufficiently large positive integer $N$ can be…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we establish a theorem of Bombieri-Vinogradov type for the Piatetski-Shapiro primes $p=[n^{1/\gamma}]$ with…

Let $1<c<\frac{26088036}{12301745},c\not=2$ and $N$ be a sufficiently large real number. In this paper, it is proved that, for almost all $R\in (N,2N]$, the Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c-R\big|<\log^{-1}N…

Let $[\, \cdot\,]$ be the floor function. In this paper, we show that when $1<c<\frac{82}{79}$, then every sufficiently large positive integer $N$ can be represented in the form \begin{equation*} N=[p^c]+[m^c]\,, \end{equation*} where $p$…

Let $1<c<832/825$. For large real numbers $N>0$ and a small constant $\vartheta>0$, the inequality \begin{equation*} |p_1^c+p_2^c+p_3^c+p_4^c-N|<\vartheta \end{equation*} has a solution in prime numbers $p_1,\,p_2,\,p_3,\,p_4$ such that,…

Let $N$ be a sufficiently large real number. In this paper, it is proved that, for $1<c<\frac{1193}{889}$, the following Diophantine inequality \begin{equation*} \big|p_1^c+p_2^c+p_3^c+p_4^c-N\big|<\log^{-1}N \end{equation*} is solvable in…

This paper contributes to the conjecture of R. Scott and R. Styer which asserts that for any fixed relatively prime positive integers $a,b$ and $c$ all greater than 1 there is at most one solution to the equation $a^x+b^y=c^z$ in positive…