Related papers: Exponential prime sequences

Let $p \geq 2$ be a large prime, and let $k \ll \log p $ be a small integer. This note proves the existence of various configurations of $(k+1)$-tuples of consecutive and quasi consecutive primitive roots $n+a_0, n+a_1, n+a_2, \ldots,…

Consider the set of all natural numbers that are co-prime to primes less than or equal to a given prime. Then given a consecutive pair of numbers in that set with an arbitrary even gap, we prove there exists an unbounded number of actual…

The chronicle of prime numbers travel back thousands of years in human history. Not only the traits of prime numbers have surprised people, but also all those endeavors made for ages to find a pattern in the appearance of prime numbers has…

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…

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…

It is proven that, in any given base, there are infinitely many palindromic numbers having at most six prime divisors, each relatively large. The work involves equidistribution estimates for the palindromes in residue classes to large…

We prove that there is a constant $c > 0$ depending only on $M \geq 1$ and $\mu \geq 0$ such that $$\int_y^{y+a}{|g(t)| \, dt} \geq \exp (-c/(a\delta))\,, a \in (0,\pi]\,,$$ for every $g$ of the form $$g(t) = \sum_{j=0}^n{a_j…

This work is a probabilistic study of the 'primes' of the Cram\'er model. We prove that there exists a set of integers $\mathcal S$ of density 1 such that \begin{equation}\liminf_{ \mathcal S\ni n\to\infty} (\log n)\mathbb{P} \{S_n\…

Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…

Let $[\,\cdot\,]$ be the floor function. In this paper we show that whenever $\eta$ is real, the constants $\lambda_i$ satisfy some necessary conditions, then for any fixed $1<c<38/37$ there exist infinitely many prime triples $p_1,\,…

The $n$th Ramanujan prime is the smallest positive integer $R_n$ such that if $x \ge R_n$, then there are at least $n$ primes in the interval $(x/2,x]$. For example, Bertrand's postulate is $R_1 = 2$. Ramanujan proved that $R_n$ exists and…

Baker, Harman, and Pintz showed that a weak form of the Prime Number Theorem holds in intervals of the form $[x-x^{0.525},x]$ for large $x$. In this paper, we extend a result of Maynard and Tao concerning small gaps between primes to…

Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.

We survey properties of the set of possible exponents of subsets of $\Z_n$ (equivalently, exponents of primitive circulant digraphs on $n$ vertices). Let $E_n$ denote this exponent set. We point out that $E_n$ contains the positive integers…

We prove the existence of primitive sets (sets of integers in which no element divides another) in which the gap between any two consecutive terms is substantially smaller than the best known upper bound for the gaps in the sequence of…

We present and analyze an algorithm to enumerate all integers $n\le x$ that can be written as the sum of consecutive $k$th powers of primes, for $k>1$. We show that the number of such integers $n$ is asymptotically bounded by a constant…

Some PARI programs have bringed out a property for the non-genus part of the class number of the imaginary quadratic fields, with respect to $(\sqrt D\,)^{\varepsilon}$, where $D$ is the absolute value of the discriminant and $\varepsilon…

We show that infinitely many three-term arithmetic progressions $N, N+d, N+2d$ of powerful numbers exist with $d = 2\sqrt{N} + 1$. We further conjecture that infinitely many of these progressions consist of three consecutive terms in the…

This paper presents a distinctive prime detection approach. This method use GM-(n+1) sequences to effectively eliminate complex numbers. The sequences, which consist of odd a number of (n+1), exclude all components except for the initial…

Various authors, including McNew, Nathanson and O'Bryant, have recently studied the maximal asymptotic density of a geometric progression free sequence of positive integers. In this paper we prove the existence of geometric progression free…