相关论文: The Zsiflaw--Legeis theorem for arbitrary bases

In this paper, we study the distribution of the digital reverses of prime numbers, which we call the "reversed primes". We prove the infinitude of reversed primes in any arithmetic progression satisfying straightforward necessary conditions…

This note offers an elementary proof of the Siegel-Walfisz theorem for primes in arithmetic progressions.

Dirichlet's theorem on arithmetic progressions called as Dirichlet prime number theorem is a classical result in number theory. Atle Selberg\cite{Selberg} gave an elementary proof of this theorem. In this article we give an alternative…

We prove new results on the additive theory of reversed primes $\overleftarrow{p}$; that is, primes $p$ which are written backwards in a fixed base $b\geq 2$. In particular, we study a variant of Goldbach's conjecture, looking at…

We prove a version of the prime number theorem for arithmetic progressions that is uniform enough to deduce the Siegel-Walfisz theorem, Hoheisel's asymptotic for intervals of length $x^{1-\delta}$, a Brun-Titchmarsh bound, and Linnik's…

We give the converse to Dirichlet's theorem on primes in arithmetic progressions by generalizing an old result of Guinand.

Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet $L$-functions is true, we then establish…

In this short note, we give two proofs of the infinitude of primes via valuation theory and give a new proof of the divergence of the sum of prime reciprocals by Roth's theorem and Euler-Legendre's theorem for arithmetic progressions.

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

For a base $b\geq 2$ and a set of digits $\mathcal{A}\subset \{0,...,b-1\}$, let $\mathcal{P}$ denote the set of prime numbers with digits restricted to $\mathcal{A}$, when written in base-$b$. We prove that if $A\subset \mathbb{N}$ has…

In the last 20 years the Gelfond conjectures concerning the well distribution of the sum-of-digits function along prime numbers and along squares have been solved and these results, which are strongly connected with the Sarnak conjecture,…

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…

In analytic number theory, several results make use of information regarding the prime values of a multiplicative function in order to extract information about its averages. Examples of such results include Wirsing's theorem and the…

Assuming a conjecture on distinct zeros of Dirichlet L-functions we get asymptotic results on the average number of representations of an integer as the sum of two primes in arithmetic progression. On the other hand the existence of good…

Given a zero-free region and an averaged zero-density estimate over all Dirichlet $L$-functions modulo $q\in\mathbb{N}$, we refine the error terms of the prime number theorem in all and almost all short arithmetic progressions. For example,…

We present the formalization of Dirichlet's theorem on the infinitude of primes in arithmetic progressions, and Selberg's elementary proof of the prime number theorem, which asserts that the number $\pi(x)$ of primes less than $x$ is…

It is shown that two conjectures put forward in the recent article Iksanov and Kostohryz (2025) are true. Namely, we prove a functional central limit theorem (FCLT) and a law of the iterated logarithm (LIL) for a random Dirichlet series…

We give a large sieve type inequality for functions supported on primes. As application we prove a conjecture by Elliott, and give bounds for short character sums over primes. The proves uses a combination of the large sieve and the Selberg…

In this article, we prove a theorem \`a la Mauduit et Rivat (prime number theorem, Moebius randomness principle) for functions that count digital blocks whose length is a growing function tending to infinity. These sequences are not…

We prove a functional limit theorem in a space of analytic functions for the random Dirichlet series $D(\alpha;z)=\sum_{n\geq 2}(\log n)^{\alpha}(\eta_n+{\rm i} \theta_n)/n^z$, properly scaled and normalized, where…