Related papers: On an equation by primes with one Linnik prime

In this paper we solve the ternary Piatetski-Shapiro inequality with prime numbers of a special form. More precisely we show that, for any fixed $1<c<\frac{427}{400}$, every sufficiently large positive number $N$ and a small constant…

In this paper, we prove that for any fixed $205/243<\gamma\leqslant1$, every sufficiently large $N$ satisfying $N\equiv 5 \pmod {24}$ can be represented as five squares of primes with one prime in $\mathcal{P}_\gamma$, which improves the…

We prove that for a positive integer $c$ and any given $\varepsilon$, $0<\varepsilon<1$, the number $N(c)$ of equations $c=a+b$, $a<b$, with positive coprime integers $a$ and $b$, which satisfy the inequality $$c <…

We show that for every $0 < \epsilon \leq 1$ and integer $k\geq 1$, there exists an integer $n = n(\epsilon,k)$ so that for all primes $p$, and integers $0 \leq a \leq p-1$, there exist integers $1 \leq x_1 < ... < x_n \leq p^\epsilon$ such…

Under the fundamental theorem of arithmetic, any integer $n>1$ can be uniquely written as a product of prime powers $p^a$; factoring each exponent $a$ as a product of prime powers $q^b$, and so on, one will obtain what is called the tower…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

Let $p$ be a prime, $\varepsilon>0$ and $0<L+1<L+N < p$. We prove that if $p^{1/2+\varepsilon}< N <p^{1-\varepsilon}$, then $$ \#\{n!\!\!\! \pmod p;\,\, L+1\le n\le L+N\} > c (N\log N)^{1/2},\,\, c=c(\varepsilon)>0. $$ We use this bound to…

Let [t] be the integral part of the real number t and let 1 P be the characteristic function of the primes. Denote by $\pi$ G (x) the number of primes in the floor function set G(x) := {[ x n ] : 1 n x} and by S 1 P (x) the number of primes…

In this paper we show that for every positive integer $n$ there exists a prime number in the interval $[n,9(n+3)/8]$. Based on this result, we prove that if $a$ is an integer greater than 1, then for every integer $n>14.4a$ there are at…

Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…

Let $N(x,y)$ denote the number of integers $n\le x$ which are divisible by a shifted prime $p-1$ with $p>y$, $p$ prime. Improving upon recent bounds of McNew, Pollack and Pomerance, we establish the exact order of growth of $N(x,y)$ for all…

For $H \ge N^{1-\frac{1}{2c}} \ln^2 N$, where $c$ is a fixed non-integer number satisfying $$ \|c\| \ge 3c\left(2^{[c]+1}-1\right)\frac{\ln \ln N}{\ln N}, \qquad c > \frac{4}{3}\left(1 + \frac{52\ln \ln N}{\ln N}\right), $$ we obtain an…

Let $[\,\cdot\,]$ denote the floor function. Assume that $\lambda_1, \lambda_2, \lambda_3, \lambda_4, \lambda_5$ are nonzero real numbers, not all of the same sign, that $\lambda_1/\lambda_2$ is irrational, and that $\eta$ is a real number.…

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

Hilberdink showed that there exists a constant $c_0>2$, such that there exists a continuous prim system satisfying $N(x)=c(x-1)+1$ if and only if $c\leq c_0$. Here we determine $c_0$ numerically to be $1.25479\cdot 10^{19}\pm2\cdot…

Let $f$ be a positive multiplicative function and let $k\geq 2$ be an integer. We prove that if the prime values $f(p)$ converge to $1$ sufficiently slowly as $p\rightarrow +\infty$, in the sense that $\sum_{p}|f(p)-1|=\infty$, there exists…

It is proved that all sufficiently large integers $n$ can be represented as $$n=x_1^2+x_2^3+\cdots+x_{13}^{14},$$ where $x_1,\ldots,x_{13}$ are positive integers. This improves upon the current record with $14$ variables in place of $13$.

Let $\Omega(n)$ denote the number of prime factors of $n$. We show that for any bounded $f\colon\mathbb{N}\to\mathbb{C}$ one has \[ \frac{1}{N}\sum_{n=1}^N\, f(\Omega(n)+1)=\frac{1}{N}\sum_{n=1}^N\, f(\Omega(n))+\mathrm{o}_{N\to\infty}(1).…

We estimate from below the lower density of the set of prime numbers p such that p-1 has a prime factor of size at least p^c, where c lies in between 1/4 and 1/2. We also establish upper and lower bounds on the counting function of the set…

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will…