Related papers: Strings of special primes in arithmetic progressio…
{\bf In the fourth extended version of this article, we provide a comprehensive historical survey of 200 different proofs of famous Euclid's theorem on the infinitude of prime numbers (300 {\small B.C.}--2022)}. The author is trying to…
Fix a non-CM elliptic curve $E/\mathbb{Q}$, and let $a_E(p) = p + 1 - \#E(\mathbb{F}_p)$ denote the trace of Frobenius at $p$. The Sato-Tate conjecture gives the limiting distribution $\mu_{ST}$ of $a_E(p)/(2\sqrt{p})$ within $[-1, 1]$. We…
We solve some famous conjectures on the distribution of primes. These conjectures are to be listed as Legendre's, Andrica's, Oppermann's, Brocard's, Cram\'{e}r's, Shanks', and five Smarandache's conjectures. We make use of both…
Natural numbers can be divided in two non-overlapping infinite sets, primes and composites, with composites factorizing into primes. Despite their apparent simplicity, the elucidation of the architecture of natural numbers with primes as…
Romanov proved that a positive proportion of the integers have a representation as a sum of a prime and a power of an arbitrary fixed positive integer. Rieger proved the analogous result for number fields. We will determine an explicit…
A study of certain Hamiltonian systems has lead Y. Long to conjecture the existence of infinitely many primes of the form $p=2[\alpha n]+1$, where $1<\alpha<2$ is a fixed irrational number. An argument of P. Ribenboim coupled with classical…
We use Maynard's methods to show that there are bounded gaps between primes in the sequence $\{\lfloor n\alpha\rfloor\}$, where $\alpha$ is an irrational number of finite type. In addition, given a superlinear function $f$ satisfying some…
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 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…
It is well known that the distribution of the prime numbers plays a central role in number theory. It has been known, since Riemann's memoir in 1860, that the distribution of prime numbers can be described by the zero-free region of the…
Recently, there has been a sharp rise of interest in properties of digits primes. Here we study yet another question of this kind. Namely, we fix an integer base $g \ge 2$ and then for every infinite sequence $${\mathcal D} =…
The twin primes conjecture is a very old problem. Tacitly it is supposed that the primes it deals with are finite. In the present paper we consider three problems that are not related to finite primes but deal with infinite integers. The…
Ferrers diagrams are used to visually represent integer partitions. We describe a way to use Ferrers diagrams to uniquely represent integers in terms of their prime factors. This leads to a lower bound on the number of primes less than a…
Using an adaptation of Qin Jiushao's method from the 13th century, it is possible to prove that a system of linear modular equations a(i,1) x(i) + ... + a(i,n) x(n) = b(i) mod m(i), i=1, ..., n has integer solutions if m(i)>1 are pairwise…
In this project we show the existence of arbitrary length arithmetic progressions in model sets and Meyer sets in the Euclidean $d$-space. We prove a van der Waerden type theorem for Meyer sets. We show that pure point subsets of Meyer sets…
We consider the summatory function of the number of prime factors for integers $\leq x$ over arithmetic progressions. Numerical experiments suggest that some arithmetic progressions consist more number of prime factors than others. Greg…
The dominance of string theory in the research landscape of quantum gravity physics (despite any direct experimental evidence) can, I think, be justified in a variety of ways. Here I focus on an argument from mathematical fertility, broadly…
In this note we generalise a method of Perott to give new proofs that there are infinitely many prime numbers.
This work proposes elementary proofs of several related primes counting problems, based on an elementary weighted sieve. The subsets of primes considered here are the followings: the subset of twin primes PT = {p and p + 2 are primes}, the…
We investigate some extremal problems in Fourier analysis and their connection to a problem in prime number theory. In particular, we improve the current bounds for the largest possible gap between consecutive primes assuming the Riemann…