English
Related papers

Related papers: Computing the Mertens and Meissel-Mertens constant…

200 papers

We obtain an asymptotic formula for the average value of the divisor function over the integers $n \le x$ in an arithmetic progression $n \equiv a \pmod q$, where $q=p^k$ for a prime $p\ge 3$ and a sufficiently large integer $k$. In…

Number Theory · Mathematics 2016-02-12 Kui Liu , Igor E. Shparlinski , Tianping Zhang

A fast and numerically stable algorithm is described for computing the discrete Hankel transform of order $0$ as well as evaluating Schl\"{o}milch and Fourier--Bessel expansions in $\mathcal{O}(N(\log N)^2/\log\!\log N)$ operations. The…

Numerical Analysis · Mathematics 2015-05-21 Alex Townsend

Fix $\delta\in(0,1]$, $\sigma_0\in[0,1)$ and a real-valued function $\varepsilon(x)$ for which $\limsup_{x\to\infty}\varepsilon(x)\le 0$. For every set of primes ${\mathcal P}$ whose counting function $\pi_{\mathcal P}(x)$ satisfies an…

Number Theory · Mathematics 2015-09-17 William D. Banks

Let $\chi$ be a Dirichlet character mod $D$ with $L(s,\chi)$ its associated $L$-function, and let $\psi(x,q,a)$ be Chebyshev's prime-counting function for primes congruent to $a$ modulo $q$. We show that under the assumption of an…

Number Theory · Mathematics 2025-09-15 Thomas Wright

Two sums over the inverse of the product of an integer n and its greatest prime factor G(n), are computed to first 13 decimal digits. These sums converge, but converge very slowly. They are transformed into sums involving Mertens' prime…

General Mathematics · Mathematics 2024-07-18 Tengiz O. Gogoberidze

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…

Logic · Mathematics 2016-08-09 Mario Carneiro

Rosser and Schoenfeld remarked that the product $\prod_{p\leq x}(1-1/p)^{-1}$ exceeds $e^{\gamma} \log x$ for all $2\leq x\leq 10^8$, and raised the question whether the difference changes sign infinitely often. This was confirmed in a…

Number Theory · Mathematics 2015-02-09 Youness Lamzouri

We discuss formulas for the asymptotic growth rate of the number of summands in tensor powers in certain (finite or infinite) monoidal categories. Our focus is on monoidal categories with infinitely many indecomposable objects, with our…

Category Theory · Mathematics 2026-04-07 Abel Lacabanne , Daniel Tubbenhauer , Pedro Vaz

The purpose of this paper is to describe asymptotic formulas for determinants of a sum of finite Toeplitz and Hankel matrices with singular generating functions. The formulas are similar to those of the analogous problem for finite Toeplitz…

Functional Analysis · Mathematics 2007-05-23 Estelle L. Basor , Torsten Ehrhardt

For a prime number $p$ and integer $x$ with $\gcd(x,p)=1$ let $\overline{x}$ denote the multiplicative inverse of $x$ modulo $p.$ In the present paper we are interested in the problem of distribution modulo $p$ of the sequence $$…

Number Theory · Mathematics 2023-04-18 Moubariz Z. Garaev , Igor E. Shparlinski

The main objective of this article is to study the asymptotic behavior of Salie sums over arithmetic progressions. We deduce from our asymptotic formula that Salie sums possess a bias of being positive. The method we use is based on…

Number Theory · Mathematics 2011-11-18 Benoit Louvel

Let $\varepsilon>0$ be a fixed small constant, ${\mathbb F}_p$ be the finite field of $p$ elements for prime $p$. We consider additive and multiplicative problems in ${\mathbb F}_p$ that involve intervals and arbitrary sets. Representative…

Number Theory · Mathematics 2023-04-19 Moubariz Z. Garaev , Igor E. Shparlinski

We obtain an asymptotic formula in q for the number of MDS codes of length n and dimension k over a finite field with q elements.

Information Theory · Computer Science 2013-11-05 Krishna Kaipa

In this paper we prove asymptotic formulas for the $L^p$ norms of $P_n(\theta)=\prod_{k=1}^n (1-e^{ik\theta})$ and $Q_n(\theta)=\prod_{k=1}^n (1+e^{ik\theta})$. These products can be expressed using $\prod_{k=1}^n…

Classical Analysis and ODEs · Mathematics 2012-10-30 Jordan Bell

In this note, we consider asymptotic products of binomial and multinomial coefficients and determine their asymptotic constants and formulas. Among them, special cases are the central binomial coefficients, the related Catalan numbers, and…

Combinatorics · Mathematics 2024-06-21 Bernd C. Kellner

The Poisson distribution of order $k$ is a special case of a compound Poisson distribution. Its mean and variance are known, but results for its median and mode are difficult to obtain, although a few cases have been solved and upper/lower…

Probability · Mathematics 2023-09-28 S. R. Mane

Let N_{a,b}(x) count the number of primes p<=x with p dividing a^k+b^k for some k>=1. It is known that asymptotically N_{a,b}(x) grows like c(a,b)x/log x for some rational number c(a,b) that depends in a rather intricate way on a and b. A…

Number Theory · Mathematics 2007-05-23 Pieter Moree

Let $p$ be an odd prime. In this paper we investigate quadratic residues modulo $p$ and related permutations, congruences and identities. If $a_1<\ldots<a_{(p-1)/2}$ are all the quadratic residues modulo $p$ among $1,\ldots,p-1$, then the…

Number Theory · Mathematics 2019-07-10 Zhi-Wei Sun

A new series representation of the Madelung constant is given. We represent Madelung constant as a sum of an exact term plus an exponentially fast converging series. The remarkable result is that even if the series part is discarded, one…

Materials Science · Physics 2009-11-10 Sandeep Tyagi

A representation for the Riemann zeta function valid for arbitrary complex $s=\sigma+it$ is $\zeta(s)=\sum_{n=0}^\infty A(n,s)$, where \[A(n,s)=\frac{2^{-n-1}}{1-2^{1-s}} \sum_{k=0}^n \left(\!\begin{array}{c}n\\k\end{array}\!\right)…

Classical Analysis and ODEs · Mathematics 2021-06-04 R B Paris