Related papers: A Conjecture about the Density of Prime Numbers

The Prime Number Theorem states that the number of primes in $\{1,\ldots,x\}$, denoted $\pi(x)$, is approximately $\frac{x}{\ln(x)}$. In this paper, we investigate the distribution of primes for domains other than $\N$. First we look at…

We consider the regular parts for basic functions of prime numbers with Riemann approximation accuracy.

The author \cite{4} proved that, for every set $S$ of positive integers containing 1 (finite or infinite) there exists the density $h=h(E(S))$ of the set $E(S)$ of numbers whose prime factorizations contain exponents only from $S,$ and gave…

For a fixed rational number g different from -1,0,1 and integers a and d the set N_g(a,d) of primes p for which the order of g(mod p) is congruent to a(mod d) is considered. It is shown, assuming the Generalized Riemann Hypothesis (GRH),…

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…

We furnish an explicit bound for the prime number theorem in short intervals on the assumption of the Riemann hypothesis.

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

In this paper, we study an asymptotic distribution of sets of primes satisfying certain "linking conditions" in arithmetic topology, namely, conditions given by the Legendre and R\'edei symbols among sets of primes. As our Main Theorem, we…

Let $\mathbf{S}$ be the set of all finite or infinite increasing sequences of positive integers. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{S},$ let us call a positive number $N$ an exponentially $S$-number $(N\in E(S)),$ if all…

Let $P$ be a subset of the primes of lower density strictly larger than $\frac12$. Then, every sufficiently large even integer is a sum of four primes from the set $P$. We establish similar results for $k$-summands, with $k\geq 4$, and for…

Motivated by the connection to the pair correlation of the Riemann zeros, we investigate the second derivative of the logarithm of the Riemann zeta function, in particular the zeros of this function. Theorem 1 gives a zero-free region.…

Chebyshev observed in a letter to Fuss that there tends to be more primes of the form $4n+3$ than of the form $4n+1$. The general phenomenon, which is referred to as Chebyshev's bias, is that primes tend to be biased in their distribution…

Periodic point sets model all solid crystalline materials whose structures are determined in a rigid form and should be studied up to rigid motion or isometry preserving inter-point distances. In 2021 H.Edelsbrunner et al. introduced an…

In this note, we generalise two results on prime numbers in short intervals. The first result is Ingham's theorem which connects the zero-density estimates with short intervals where the prime number theorem holds, and the second result is…

A prime p is called Sophie Germain prime if 2p+1 is also prime. A formula for the density of such primes is given in a more general setting using a new approach. This method uses the Ramanujan-Fourier series for a modified von Mangoldt…

We propose and analyze an algorithm to approximate distribution functions and densities of perpetuities. Our algorithm refines an earlier approach based on iterating discretized versions of the fixed point equation that defines the…

Let $(u_n)_{n \geq 0}$ be a nondegenerate linear recurrence of integers, and let $\mathcal{A}$ be the set of positive integers $n$ such that $u_n$ and $n$ are relatively prime. We prove that $\mathcal{A}$ has an asymptotic density, and that…

Let $f$ be a primitive positive definite integral binary quadratic form of discriminant $-D$ and let $\pi_f(x)$ be the number of primes up to $x$ which are represented by $f$. We prove several types of upper bounds for $\pi_f(x)$ within a…

Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…

We provide upper bounds on the density of a symmetric generalized arithmetic progression lacking nonzero elements of the form h(n) for natural numbers n, or h(p) with p prime, for appropriate polynomials h with integer coefficients. The…