Related papers: Inclusive prime number races

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…

The Gini index is a number that attempts to measure how equitably a resource is distributed throughout a population, and is commonly used in economics as a measurement of inequality of wealth or income. The Gini index is often defined as…

In Pacific J. Math. 292 (2018), 223-238, Shareshian and Woodroofe asked if for every positive integer $n$ there exist primes $p$ and $q$ such that, for all integers $k$ with $1 \leq k \leq n-1$, the binomial coefficient $\binom{n}{k}$ is…

Let $q>r\ge1$ be coprime positive integers. We empirically study the maximal gaps $G_{q,r}(x)$ between primes $p=qn+r\le x$, $n\in{\mathbb N}$. Extensive computations suggest that almost always $G_{q,r}(x)<\varphi(q)\log^2x$. More…

On the assumption of the Riemann hypothesis, we give explicit upper bounds on the difference between consecutive prime numbers.

We consider the problem of counting matrices over a finite field with fixed rank and support contained in a fixed set. The count of such matrices gives a $q$-analogue of the classical rook and hit numbers, known as the $q$-rook and $q$-hit…

Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…

Numerical study of the distribution of the Riemann zeros differences following the work [1] shows the significance of the function for which the prime sum expression is proposed. Computational results related to this definition explored…

In this paper, we define $X$-base Fibonacci-Wieferich prime which is a generalized Wieferich prime where $X$ is a finite set of algebraic numbers. We are going to show that there are infinitely many non-$X$-base Fibonacci-Wieferich primes…

The ``impossibility theorem'' -- which is considered foundational in algorithmic fairness literature -- asserts that there must be trade-offs between common notions of fairness and performance when fitting statistical models, except in two…

Prime numbers have fascinated mathematicians since antiquity, with ongoing efforts to uncover both their properties and ever-larger examples. While giant primes rarely aid cryptography, they find use in areas such as locally decodable…

Let $E_0,\ldots,E_n$ be a partition of the set of prime numbers, and define $E_j(x) := \sum_{p \in E_j \atop p \leq x} \frac{1}{p}$. Define $\pi(x;\mathbf{E},\mathbf{k})$ to be the number of integers $n \leq x$ with $k_j$ prime factors in…

The appearance of primes in a family of linear recurrence sequences labelled by a positive integer $n$ is considered. The terms of each sequence correspond to a particular class of Lehmer numbers, or (viewing them as polynomials in $n$)…

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…

This paper discusses a few main topics in Number Theory, such as the M\"{o}bius function and its generalization, leading up to the derivation of neat power series for the prime counting function, $\pi(x)$, and the prime-power counting…

We prove an asymptotic formula for the number of primes of the shape $a^2 +p^4$, thereby refining the well known work of Friedlander and Iwaniec. Along the way, we prove a result on equidistribution of primes up to $x$, in which the moduli…

The Schinzel Hypothesis is a celebrated conjecture in number theory linking polynomial values and prime numbers. In the same vein we investigate the common divisors of values $P_1(n),\ldots, P_s(n)$ of several polynomials. We deduce this…

By using Beta Dirichlet series and then Eisenstein series we ca represent primes with first a good approximation and an exact expression. This can be done with arbitrary prime (up to 10^101).

We prove some results concerning the distribution of primes on the Riemann hypothesis. First, we prove the explicit result that there exists a prime in the interval $(x-\frac{4}{\pi} \sqrt{x} \log x,x]$ for all $x \geq 2$; this improves a…

Let $f(x)\in \mathbb{Z}[x]$ be an irreducible polynomial of degree $d\ge 1$. Let $k\ge2$ be an integer. The number of integers $n$ such that $f(n)$ is $k$-free is widely studied in the literature. In principle, one expects that $f(n)$ is…