Related papers: Symmetric primes revisited

Dirichlet's proof of infinitely many primes in arithmetic progressions was published in 1837, introduced L-series for the first time, and it is said to have started rigorous analytic number theory. Dirichlet uses Euler's earlier work on the…

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$ 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 prove that the error in the prime number theorem can be quantitatively improved beyond the Riemann Hypothesis bound by using versions of Montgomery's conjecture for the pair correlation of zeros of the Riemann zeta-function which are…

The present article includes the enumeration of $n$-polygons with a certain symmetry property: For an even number $n$ of vertices, we count the $n$-polygons with $\frac{n}{2}$ symmetry axes. In addition, if $n$ is a power of 2, we show the…

We create a simple test for distinguishing between sets of primes and random numbers using just the sum-of-digits function. We find that the sum-of-the-digits of prime numbers does not have an equal probability of being odd or even. The…

Jagy and Kaplansky exhibited a table of 68 pairs of positive definite binary quadratic forms that represent the same odd primes and conjectured that this list is complete outside of "trivial" pairs. In this article, we find all pairs of…

A positive integer $n$ is defined to be cyclic if and only if every group of size $n$ is cyclic. Equivalently, $n$ is cyclic if and only if $n$ is relatively prime to the number of positive integers less than $n$ that are relatively prime…

Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r.…

Let $p_n$ be $n$th prime, and let $(S_n)_{n=1}^\infty:=(S_n)$ be the sequence of the sums of the first $2n$ consecutive primes, that is, $S_n=\sum_{k=1}^{2n}p_k$ with $n=1,2,\ldots$. Heuristic arguments supported by the corresponding…

A consequence of Bertrand's postulate, proved by L. Greenfield and S. Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ can be partitioned into pairs so that the sum of each pair is a prime number for any positive…

Making use of covering systems and a theorem of D. Shiu, the first and second authors showed that for every positive integer $k$, there exist $k$ consecutive widely digitally delicate primes. They also noted that for every positive integer…

In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…

It is the purpose of this thesis to enunciate and prove a collection of explicit results in the theory of prime numbers. First, the problem of primes in short intervals is considered. We prove that there is a prime between consecutive cubes…

Euler showed that there are infinitely many triangular numbers that are three times other triangular numbers. In general, it is an easy consequence of the Pell equation that for a given square-free m > 1, the relation P=mP' is satisfied by…

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

We prove a kind of "almost all symmetry" result for the primes, i.e. we give non-trivial bounds for the "symmetry integral", say $I_{\Lambda}(N,h)$, of the von Mangoldt function $\Lambda(n)$ ($:= \log p$ for prime-powers $n=p^r$, 0…

In 1992, Erd$\H{o}$s and Hegyv$\'{a}$ri showed that for any prime p, there exist infinitely many length 3 weakly prime-additive numbers divisible by p. In 2018, Fang and Chen showed that for any positive integer m, there exists infinitely…

A supercongruence is a congruence between rational numbers modulo a power of a prime. In this paper, we give a technique for finding and algorithmically proving supercongruences by expressing terms as infinite series involving certain…

Let $k$ be an integer which is the difference between prime numbers infinitely often. It is known that there are infinitely many such $k$ and, in this paper, we give a new unconditional proof that these $k$ have positive density and improve…