English
Related papers

Related papers: Effective estimates for some functions defined ove…

200 papers

Elementary function calls are a common feature in numerical programs. While their implementions in library functions are highly optimized, their computation is nonetheless very expensive compared to plain arithmetic. Full accuracy is,…

Numerical Analysis · Computer Science 2018-11-27 Eva Darulova , Anastasia Volkova

We study arithmetic functions $\Phi(x;d,a)$, called prime running functions, whose value at $x$ sums the gaps between primes $p_k \equiv a\ (\text{mod}\ d)$ below $x$ and the next following prime $p_{k+1}$, up to $x$. (The following prime…

Number Theory · Mathematics 2020-06-25 Jaeyoon Kim

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

Number Theory · Mathematics 2007-05-23 R. M. Abrarov , S. M. Abrarov

Best possible bounds are obtained for the concentration function of an additive arithmetic function on sequences of shifted primes.

Number Theory · Mathematics 2008-02-03 P. D. T. A. Elliott

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…

General Mathematics · Mathematics 2021-04-02 Jose Risomar Sousa

The set of short intervals between consecutive primes squared has the pleasant---but seemingly unexploited---property that each interval $s_k:=\{p_k^2, \dots,p_{k+1}^2-1\}$ is fully sieved by the $k$ first primes. Here we take advantage of…

Number Theory · Mathematics 2014-08-13 Kolbjørn Tunstrøm

We will prove that for every $m\geq 0$ there exists an $\varepsilon=\varepsilon(m)>0$ such that if $0<\lambda<\varepsilon$ and $x$ is sufficiently large in terms of $m$ and $\lambda$, then $$|\lbrace n\leq x: |[n,n+\lambda\log n]\cap…

Number Theory · Mathematics 2019-01-01 Daniele Mastrostefano

Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.

Number Theory · Mathematics 2017-06-14 Christian Axler

We provide an elementary proof of an asymptotic formula for prime counting functions. As a minor application we give a new reduction of the proof of Chebotar\"ev's density theorem to the cyclic case.

Number Theory · Mathematics 2019-11-11 Andrew O'Desky

We present some new ideas on important problems related to primes. The topics of our discussion are: simple formulae for primes, twin primes, Sophie Germain primes, prime tuples less than or equal to a predefined number, and their…

General Mathematics · Mathematics 2015-11-24 Dhananjay P. Mehendale

We reveal a relationship between the prime counting function and an operation performed on a unique subsequence of the primes.

General Mathematics · Mathematics 2023-06-21 Michael P. May

Let f(m,n) denote the number of relatively prime subsets of {m+1,m+2,...,n}, and let Phi(m,n) denote the number of subsets A of {m+1,m+2,...,n} such that gcd(A) is relatively prime to n. Let f_k(m,n) and Phi_k(m,n) be the analogous counting…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson , Brooke Orosz

An overview of the results of new exhaustive computations of gaps between primes in arithmetic progressions is presented. We also give new numerical results for exceptionally large least primes in arithmetic progressions.

Number Theory · Mathematics 2023-04-06 Martin Raab

This short note provides a sharper upper bound of a well known inequality for the sum of divisors function. This is a problem in pure mathematics related to the distribution of prime numbers. Furthermore, the technique is completely…

Number Theory · Mathematics 2023-09-18 N. A. Carella

For a fixed exponent $0 < \theta \leq 1$, it is expected that we have the prime number theorem in short intervals $\sum_{x \leq n < x+x^\theta} \Lambda(n) \sim x^\theta$ as $x \to \infty$. From the recent zero density estimates of Guth and…

Number Theory · Mathematics 2026-05-27 Ayla Gafni , Terence Tao

Results on two different settings of asymptotic behavior of approximation characteristics of individual functions are presented. First, we discuss the following classical question for sparse approximation. Is it true that for any individual…

Numerical Analysis · Mathematics 2019-11-11 L. Burusheva , V. Temlyakov

We study function estimation in the empirical Bayes setting for Poisson and normal means. Specifically, given observations $Y_i\sim f(\cdot; \theta_i)$ with latent parameters $\theta_i\sim \pi$, the goal is to estimate…

Statistics Theory · Mathematics 2026-01-27 Benjamin Kang , Yury Polyanskiy , Anzo Teh

We survey the classical results on the prime number theorem

Number Theory · Mathematics 2007-05-23 Yong-Cheol Kim

An improved estimate is given for $|\theta(x) -x|$, where $\theta(x) = \sum_{p\leq x} \log p$. Three applications are given: the first to arithmetic progressions that have points in common, the second to primes in short intervals, and the…

Number Theory · Mathematics 2014-10-20 Tim Trudgian

Let $N$ be the counting function of a Beurling generalized number system and let $\pi$ be the counting function of its primes. We show that the $L^{1}$-condition $$ \int_{1}^{\infty}|\frac{N(x)-ax}{x}|\frac{\mathrm{d}x}{x}<\infty $$ and the…

Number Theory · Mathematics 2013-05-02 Jasson Vindas
‹ Prev 1 3 4 5 6 7 10 Next ›