Related papers: Primes and almost primes between cubes

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the…

A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known…

We combine transcendental methods and the modular approaches to the $ABC$ conjecture to show that the largest prime factor of $n^2+1$ is at least of size $(\log_2 n)^2/\log_3n$ where $\log_k$ is the $k$-th iterate of the logarithm. This…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

We analyze the inequality $\sqrt{P_{k+1}}-\sqrt{P_{k}}<1,\ k\in\mathbb{N}$, discuss the existence of primes on arbitrary intervals $(r,s),\ r<s,\ r,s\in\mathbb{R}$, and finally address the issue of primes between squares of naturals.

In the number $373$ all subwords ($3$, $7$, $37$, $73$, and $373$) are prime. Similarly, in $9719$ all subwords are divisible by at most one prime. And similarly again in $7319797913$ all subwords are divisible by at most two primes. These…

We prove explicit bounds for the number of sums of consecutive prime squares below a given magnitude.

Let $p$ and $q$ be two distinct fixed prime numbers and $(n_i)_{i\geq 0}$ the sequence of consecutive integers of the form $p^a\cdot q^b$ with $a,b\ge 0$. Tijdeman gave a lower bound (1973) and an upper bound (1974) for the gap size…

We address the question of the infinitude of twin and cousin prime pairs from a probabilistic perspective. Our approach partitions the set of integer numbers greater than $2$ in finite intervals of the form $[p_{n-1}^2,p_n^2)$, $p_{n-1}$…

We prove that it is always possible to find a permutation $p$ on the set $\{1,...,n\}$ such that $c+p(c)$ is prime for all $c \in \{1,...,n\}.$

A positive integer is called an $E_j$-number if it is the product of $j$ distinct primes. We prove that there are infinitely many triples of $E_2$-numbers within a gap size of $32$ and infinitely many triples of $E_3$-numbers within a gap…

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

For a positive integer $n,$ define $$C_n=\prod_{k=1}^n(k^3+1).$$ In this paper we prove that there are no cubes in the integer sequence $C_n,~n=1,2,\cdots.$

The following is proven using arguments that do not revolve around the Riemann Hypothesis or Sieve Theory. If $p_n$ is the $n^{\rm th}$ prime and $g_n=p_{n+1}-p_n$, then $g_n=O({p_n}^{2/3})$.

Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…

We show by an inclusion-exclusion argument that the prime $k$-tuple conjecture of Hardy and Littlewood provides an asymptotic formula for the number of consecutive prime numbers which are a specified distance apart. This refines one aspect…

Let $a,b>0$ be coprime integers. Assuming a conjecture on Hecke eigenvalues along binary cubic forms, we prove an asymptotic formula for the number of primes of the form $ax^2+by^3$ with $x \leq X^{1/2}$ and $y \leq X^{1/3}$. The proof…

We characterize the integers n such that $x\mapsto x^3$ describes a bijection from the set $\mathbb{Z}/n\mathbb{Z}$ to itself and we determine the frequency of these integers. Precisely, denoting by $W$ the set of these integers, we prove…

We study whether several consecutive prime gaps can all be relatively large at the same time, or is it possible that all are squares or perfect powers, or perhaps none of them are squares? A few related results and problems are also…

A perfect cuboid is a rectangular parallelepiped whose all linear extents are given by integer numbers, i. e. its edges, its face diagonals, and its space diagonal are of integer lengths. None of perfect cuboids is known thus far. Their…