Related papers: Primes In Cubic Arithmetic Progressions

Let 0 < a < b be two relatively prime integers and let <a,b> be the numerical semigroup generated by a and b with Frobenius number g(a,b)=ab-a-b. In this note, we prove that there exists a prime number p in <a,b> with p < g(a,b) when the…

The set of integers which can be written as the sum of four prime cubes has lower density at least $0.009664$. This improves earlier bounds of $0.003125$ by Ren and $0.005776$ by Liu.

We prove that there is a prime between $n^3$ and $(n+1)^3$ for all $n \geq \exp(\exp(33.217))$. Our new tool which we derive is a version of Landau's explicit formula for the Riemann zeta-function with explicit bounds on the error term. We…

We introduce the concept of an almost prime number generalizing a prime number. It turns out that a composite almost prime number must be a Carmichael number, in case it exists. We prove several properties of almost prime numbers and…

Let $p$ be a prime. We define $S(p)$ the smallest number $k$ such that every positive integer is a sum of at most $k$ squares of integers that are not divisible by $p$. In this article, we prove that $S(2)=10$, $S(3)=6$, $S(5)=5$, and…

For every prime $p$, we construct an infinite countable group that contains precisely $p-1$ elements which are not $p$th powers.

The idea of generating prime numbers through sequence of sets of co-primes was the starting point of this paper that ends up by proving two conjectures, the existence of infinitely many twin primes and the Goldbach conjecture. The main idea…

Infinite exponential sequences of distinct prime numbers of the form $\lfloor a c^{n^d}+b\rfloor$, $n\geq 0$, are proved to exist for well chosen real constants $a>0$, $b$, $c>1$, $d>1$, assuming Cramer's conjecture on prime gaps. There is…

A conjecture of Cai-Zhang-Shen for figurate primes says that every integer $k>1$ is the sum of two figurate primes. In this paper we give an equivalent proposition to the conjecture. By considering extreme value problems with constraints…

Let $n\in\mathbb{Z}^+$. In [8] we ask the question whether any sequence of $n$ consecutive integers greater than $n^2$ and smaller than $(n+1)^2$ contains at least one prime number, and we show that this is actually the case for every…

We establish the existence of infinitely many \emph{polynomial} progressions in the primes; more precisely, given any integer-valued polynomials $P_1, >..., P_k \in \Z[\m]$ in one unknown $\m$ with $P_1(0) = ... = P_k(0) = 0$ and any $\eps…

Let $p\equiv 2,5\mod 9$ be a prime. We prove that both $3p$ and $3p^2$ are cube sums. We also establish some explicit Gross-Zagier formulae and investigate the 3 part full BSD conjecture of the related elliptic curves.

We found a regularity of the behavior of primes that allows to represent both prime and natural numbers as infinite matrices with a common formation rule of their rows. This regularity determines a new class of infinite cyclic groups that…

In this paper, a new formula for {\pi}^(2)(N) is formulated, it is a function that counts the number of semi-primes not exceeding a given number N. A semi-prime is a natural number that is the product of precisely two prime numbers, the two…

For $x>0$ let $\pi(x)$ denote the number of primes not exceeding $x$. For integers $a$ and $m>0$, we determine when there is an integer $n>1$ with $\pi(n)=(n+a)/m$. In particular, we show that for any integers $m>2$ and $a\le\lceil…

Given positive integers a,b,c and d such that c and d are coprime we show that the primes p=c(mod d)dividing a^k+b^k for some k>=1 have a natural density and explicitly compute this density. We demonstrate our results by considering some…

A set of natural numbers is primitive if no element of the set divides another. Erd\H{o}s conjectured that if S is any primitive set, then \sum_{n\in S} 1/(n log n) \le \sum_{n\in \P} 1/(p log p), where \P denotes the set of primes. In this…

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

We establish that almost every positive integer $n$ is the sum of four cubes, two of which are at most $n^{\theta}$, as long as $\theta\geq192/869$. An asymptotic formula for the number of such representations is established when…

Gerard and Washington proved that, for $k > -1$, the number of primes less than $x^{k+1}$ can be well approximated by summing the $k$-th powers of all primes up to $x$. We extend this result to primes in arithmetic progressions: we prove…