Related papers: Gaps between primes
We prove that for a positive integer $k$ the primes in certain kinds of intervals can not distribute too 'uniformly' among the reduced residue classes modulo $k$. Hereby, we prove a generalization of a conjecture of Recaman and establish…
A new set of formulas for primes is presented. These formulas are more efficient and grow much slower than the two known formulas of Mills and Wright. 3 new formulas are explained.
Prime numbers have attracted the attention of mathematiciansand enthusiasts for millenniums due to their simple definition and remarkable properties. In this paper, we study primorial numbers (the product of the first prime numbers) to…
Fix coprime natural numbers $a,q$. Assuming the Prime $k$-tuple Conjecture, we show that there exist arbitrarily long arithmetic progressions of Carmichael numbers, each of which lies in the reduced residue class $a$ mod $q$ and is a…
We investigate a conjecture about stabilisation of deficiency in finite index subgroups and relate it to the D2 Problem of C.T.C. Wall and the Relation Gap problem. We verify the pro-$p$ version of the conjecture, as well as its higher…
In the present work we investigate the largest possible gaps between consecutive numbers which can be written as the difference of two primes. The best known upper bounds are the same as those concerning the largest possible difference of…
The Cram\'er-Granville conjecture is an upper bound on prime gaps, $g_n = p_{n+1} - p_n < \cCramer \, \log^2 p_n$ for some constant $\cCramer \geq 1$. Using a formula of Selberg, we first prove the weaker summed version: $\sum_{n=1}^N g_n <…
Let $p_n$ denote the $n$-th prime number, $\{q_n\}$ be a sequence of positive numbers and $x\in\mathbb{R}$. In this note we prove that the inequality $$q_n p_{n+1}^{x}-q_{n+1}p_{n}^{x}<p_{n}^{x}p_{n+1}^{x-1}, $$ holds for infinitely many…
We study pairs of consecutive odd numbers through a straightforward indexing. We focus in particular on twin primes and their distribution. With a counting argument, we calculate the limit of an alternating sum that is equal to 1 which…
In the recent preprint [3], Goldston, Pintz, and Y{\i}ld{\i}r{\i}m established, among other things, $$ \liminf_{n\to\infty}{p_{n+1}-p_n\over\log p_n}=0,\leqno(0) $$ with $p_n$ the $n$th prime. In the present article, which is essentially…
We give an explicit form of Ingham's Theorem on primes in the short intervals, and show that there is at least one prime between every two consecutive cubes $x\sp{3}$ and $(x+1)\sp{3}$ if $\log\log x\ge 15$.
We develop conjectures and theorems expressing the idea that the prime sequence exhibits computational irreducibility in the transition from one prime to its successor. Informally, given a prime pp p, no general algorithm can compute the…
We adopt an empirical approach to the characterization of the distribution of twin primes within the set of primes, rather than in the set of all natural numbers. The occurrences of twin primes in any finite sequence of primes are like…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
The paper substantiates the conjecture of the asymptotic behavior of the largest distance between consecutive primes: $sup_{p_i \leq x}(p_{i+1}-p_i) \sim 2e^{-\gamma} \log^2(x)$, where $\gamma$ is the Euler constant. The Hardy-Littlewood…
Quite recently, in [8] the authoor of this paper considered the distribution of primes in the sequence $(S_n)$ whose $n$th term is defined as $S_n=\sum_{k=1}^{2n}p_k$, where $p_k$ is the $k$th prime. Some heuristic arguments and the…
In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^3$ and $(n+1)^3$ for $n^3\leq 1.649\cdot 10^{40}$. In addition,…
The purpose of this article is to survey the developments on the Kakeya problem in recent years, concentrating on the period after the excellent 1999 survey of Wolff, and including some recent work by the authors. We will focus on 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 sequences…
For earlier considered our sequence A166944 in [4] we prove three statements of its connection with twin primes. We also give a sufficient condition for the infinity of twin primes and pose several new conjectures; among them we propose a…