Related papers: On the Weakly Prime-Additive Numbers with Length 4

The Green-Tao Theorem, one of the most celebrated theorems in modern number theory, states that there exist arbitrarily long arithmetic progressions of prime numbers. In a related but different direction, a recent theorem of Shiu proves…

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the…

Let $E$ be an elliptic curve over $\Q$ without complex multiplication, and which is not isogenous to a curve with non-trivial rational torsion. For each prime $p$ of good reduction, let $|E(\F_p)|$ be the order of the group of points of the…

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…

In the present paper we prove that under the assumption of the GRH (Generalized Riemann Hypothesis) each sufficiently large odd integer can be expressed as the sum of a prime and two isolated primes.

It is well-known that for any non-constant polynomial $P$ with integer coefficients the sequence $(P(n))_{ n\in \mathbb N}$ has the property that there are infinitely many prime numbers dividing at least one term of this sequence.…

Green and Tao proved that the primes contains arbitrarily long arithmetic progressions. We show that, essentially the same proof leads to the following result: The primes in an short interval contains many arithmetic progressions of any…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

For a prime $p$, let $Z(p)$ be the smallest positive integer $n$ so that $p$ divides $F_{n}$, the $n$th term in the Fibonacci sequence. Paul Bruckman and Peter Anderson conjectured a formula for $\zeta(m)$, the density of primes $p$ for…

Let $n$ be a positive integer and $f(x) := x^{2^n}+1$. In this paper, we study orders of primes dividing products of the form $P_{m,n}:=f(1)f(2)\cdots f(m)$. We prove that if $m > \max\{10^{12},4^{n+1}\}$, then there exists a prime divisor…

This paper makes the following conjecture: For every prime $p$ there exists a positive integer $x$ with $\left\lceil \frac{p}{4} \right\rceil \leq x \leq \left\lceil \frac{p}{2} \right\rceil$ and a positive divisor $d|x^2$ so that either:…

We confirm Chebyshev's observation that primes are strikingly more abundant in non-square residue classes modulo a fixed integer under the Generalized Riemann Hypothesis (GRH) by proving a (natural) density $1$ statement for prime counting…

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, we generalize the result of Vaughan for ternary admissible exponent. Moreover, we use the refined admissible…

The Bergelson-Leibman theorem states that if P_1, ..., P_k are polynomials with integer coefficients, then any subset of the integers of positive upper density contains a polynomial configuration x+P_1(m), ..., x+P_k(m), where x,m are…

A positive integer $n$ is a Cayley number if every vertex-transitive graph of order $n$ is a Cayley graph. In 1983, Dragan Maru\v{s}i\v{c} posed the problem of determining the Cayley numbers. In this paper we give an infinite set $S$ of…

We prove an explicit error term for the $\psi(x,\chi)$ function assuming the Generalized Riemann Hypothesis. Using this estimate, we prove a conditional explicit bound for the number of primes in arithmetic progressions.

Let $P(m)$ denote the greatest prime factor of $m$. For integer $a>1$, M. Ram Murty and S. Wong proved that, under the assumption of the ABC conjecture, $$P(a^n-1)\gg_{\epsilon, a} n^{2-\epsilon}$$ for any $\epsilon>0$. We study analogues…

Given a finitely generated multiplicative subgroup of rational numbers $\Gamma$, assuming the Generalized Riemann Hypothesis, we determine an asymptotic formula for average over prime numbers, powers of the order of the reduction group…

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

Let $k\ge 2$ and $\Pi(n)=\prod_{i=1}^k(a_in+b_i)$ for some integers $a_i, b_i$ ($1\le i\le k$). Suppose that $\Pi(n)$ has no fixed prime divisors. Weighted sieves have shown for infinitely many integers $n$ that $\Omega(\Pi(n))\le r_k$…