Related papers: An effective analytic recurrence for prime numbers

We study a recursively defined sequence which is constructed using the least common multiple. It has been conjectured that every term of that sequence is $1$ or a prime. In this paper we show that this claim is connected to a strong version…

Let a and b be non-zero rational numbers that are multiplicatively independent. We study the natural density of the set of primes p for which the subgroup of the multiplicative group of the finite field with p elements generated by (a\mod…

In this paper we prove a new recurrence relation on the van der Waerden numbers, $w(r,k)$. In particular, if $p$ is a prime and $p\leq k$ then $w(r, k) > p \cdot \left(w\left(r - \left\lceil \frac{r}{p}\right\rceil, k\right) -1\right)$.…

For n=1,2,3,... define S(n) as the smallest integer m>1 such that those 2k(k-1) mod m for k=1,...,n are pairwise distinct; we show that S(n) is the least prime greater than 2n-2 and hence the value set of the function S(n) is exactly the…

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

ABSTRACT. In this article we present a point of view that highlights the importance of finding the upper bounds for prime gaps, in order to solve the twin primes conjecture and the Goldbach conjecture. For this purpose, we present a…

Let $\alpha, \beta \geq 0$ and $\alpha + \beta < 1$. In this short note, we show that $\liminf_{n \to \infty} p_n^\beta(p_{n+1}^\alpha - p_n^\alpha) = 0$, where $p_n$ is the $n$th prime. This notes an improvement over results of S\'{a}ndor…

This paper introduces a new method to find the next prime number after a given prime ${P}$. The proposed method is used to derive a system of inequalities, that serve as constraints which should be satisfied by all primes whose successor is…

In this paper we establish some new supercongruences motivated by the well-known fact $\lim_{n\to\infty}(1+1/n)^n=e$. Let $p>3$ be a prime. We prove that $$\sum_{k=0}^{p-1}\binom{-1/(p+1)}k^{p+1}\equiv 0\ \pmod{p^5}\ \ \ \mbox{and}\ \ \…

Let $g(n)$ be the largest positive integer $k$ such that there are distinct primes $p_i$ for $1\leq i\leq k$ so that $p_i |n+i$. This function is related to a celebrated conjecture of C.A. Grimm. We establish upper and lower bounds for…

Let $p_n$ be the $n$th prime, and consider the sequence $s_n = (2\cdot3\cdots p_n)^{1/n} = (p_n\#)^{1/n}$, the geometric mean of the first $n$ primes. We give a short proof that $p_n/s_n \to e$, a result conjectured by Vrba (2010) and…

Using a sieve-theoretic argument, we show that almost all gaps $(p_n, p_{n+1})$ between consecutive primes $p_n, p_{n+1}$ contain a natural number $m$ whose least prime factor $p(m)$ is at least the length $p_{n+1} - p_n$ of the gap,…

We introduce a method for showing that there exist prime numbers which are very close together. The method depends on the level of distribution of primes in arithmetic progressions. Assuming the Elliott-Halberstam conjecture, we prove that…

We establish explicit unconditional results on the graphic properties of the prime gap sequence. Let $p_n$ denote the $n$-th prime number (with $p_0=1$) and $\mathrm{PD}_n = (p_\ell - p_{\ell-1})_{\ell=1}^n$ be the sequence of the first $n$…

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…

Let $p_{1}$, ..., $p_{k}$ be the first $k$ odd primes in succession. Let $n$ be an even integer such that $n > p_{k}$. We conjecture that if none of $n - p_{1}$, ..., $n - p_{k}$ are prime, then at least one of them has a prime factor which…

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Let $p$ be a prime number and let $k\geq 2$ be an integer. In this article we study the semi-simple reductions modulo $p$ of two-dimensional irreducible crystalline $p$-adic Galois representations with Hodge-Tate weights $0$ and $k-1$ and…

Let $X$ be a scheme of finite type over $\mathbf{Z}$. For $p \in \mathcal{P}$ the set of prime numbers, let $N_{X}(p)$ be the number of $\mathbf{F}_{p}$-points of $X/\mathbf{F}_{p}$. For fixed $n\geq 1$ and $a_{1}, \ldots, a_{n} \in…

A composite positive integer $n$ has the Lehmer property if $\phi(n)$ divides $n-1,$ where $\phi$ is an Euler totient function. In this note we shall prove that if $n$ has the Lehmer property, then $n\leq 2^{2^{K}}-2^{2^{K-1}}$, where $K$…