English
Related papers

Related papers: An improved analytic Method for calculating $\pi(x…

200 papers

The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…

General Mathematics · Mathematics 2014-12-30 Ramin Zahedi

We prove the infinitude of shifted primes $p-1$ without prime factors above $p^{0.2844}$. This refines $p^{0.2961}$ from Baker and Harman in 1998. Consequently, we obtain an improved lower bound on the the distribution of Carmichael…

Number Theory · Mathematics 2022-11-18 Jared Duker Lichtman

We propose an approach for calculating $K\to\pi\pi$ decays to the next-to-leading order in chiral expansion. A detailed numerical study of this approach is being performed.

High Energy Physics - Lattice · Physics 2016-08-16 Ph. Boucaud , V. Giménez , C. -J. D. Lin , V. Lubicz , G. Martinelli , M. Papinutto , F. Rapuano , C. T. Sachrajda

Let $1<a<b$ be two relatively prime integers and $\mathbb{Z}_{\ge 0}$ the set of non-negative integers. For any non-negative integer $\ell$, denote by $g_{\ell,a,b}$ the largest integer $n$ such that the equation $$n=ax+by,\quad…

Number Theory · Mathematics 2025-10-03 Yuchen Ding , Takao Komatsu , Honghu Liu

We prove that the number of overpseudoprimes to base 2 not exceeding x does not exceed x^(3/4)(1+o(1)).

Number Theory · Mathematics 2009-09-29 Vladimir Shevelev

We present a function that tests for primality, factorizes composites and builds a closed form expression of $\pi(n^2)$ in terms of $\sum_{3 \leq p \leq n} \frac{1}{p}$ and a weaker version of $\omega(n)$.

General Mathematics · Mathematics 2017-01-23 Madieyna Diouf

In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…

Number Theory · Mathematics 2018-10-05 Christian Axler

For a given transcendental number $\xi$ and for any polynomial $P(X)=: \lambda_0+\cdots+\lambda_k X^k \in \mathbb{Z}[X]$, we know that $ P(\xi) \neq 0.$ Let $k \geq 1$ and $\omega (k, H)$ be the infimum of the numbers $r > 0$ satisfying the…

Number Theory · Mathematics 2023-03-13 Marta Dujella , Anne-Maria Ernvall-Hytönen , Linda Frey , Bidisha Roy

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

This paper uses concepts introduced by Fiorilli and Martin to develop a more accurate remainder term in calculations of the distribution of primes in residue classes. Using it in Rubinstein and Sarnak's method estimates the limiting…

Number Theory · Mathematics 2013-01-09 Colin Myerscough

Throughout more than two millennia many formulas have been obtained, some of them beautiful, to calculate the number pi. Among them, we can find series, infinite products, expansions as continued fractions and expansions using radicals.…

History and Overview · Mathematics 2009-04-02 Jesus Guillera

A classic question in analytic number theory is to find asymptotics for $\sigma_{k}(x)$ and $\pi_{k}(x)$, the number of integers $n\leq x$ with exactly $k$ prime factors, where $\pi_{k}(x)$ has the added constraint that all the factors are…

Number Theory · Mathematics 2023-03-13 Eric Naslund

In this paper we establish function field versions of two classical conjectures on prime numbers. The first says that the number of primes in intervals (x,x+x^epsilon] is about x^epsilon/log x and the second says that the number of primes…

Number Theory · Mathematics 2015-11-03 Efrat Bank , Lior Bary-Soroker , Lior Rosenzweig

We prove that the primes below $x$ are, on average, equidistributed in arithmetic progressions to smooth moduli of size up to $x^{1/2+1/40-\epsilon}$. The exponent of distribution $\tfrac{1}{2} + \tfrac{1}{40}$ improves on a result of…

Number Theory · Mathematics 2025-02-25 Julia Stadlmann

A simple way is shown to construct the length $\pi$ from the unit length with 4 digits accuracy.

History and Overview · Mathematics 2018-06-07 Zoltán Kovács

Let $X$ be a large parameter. We will first give a new estimate for the integral moments of primes in short intervals of the type $(p,p+h]$, where $p\leq X$ is a prime number and $h=\odi{X}$. Then we will apply this to prove that for every…

Number Theory · Mathematics 2013-02-14 D. Bazzanella , A. Languasco , A. Zaccagnini

In 2005, E. Noel and G. Panos constructed a formula to count the number of semiprimes less than a given value $x$. In 2006, this formula was rediscovered independently by R.G. Wilson V. However, each citation of this result was simply…

Number Theory · Mathematics 2023-10-24 Steven Creech

In this paper we show that for any prime number $p$ not equal to $11$ or $19$, the Tribonacci number $T_{p-1}$ is divisible by $p$ if and only if $p$ is of the form $x^2+11y^2$. We first use class field theory on the Galois closure of the…

Number Theory · Mathematics 2019-06-14 Tim Evink , Paul Alexander Helminck

Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{…

Number Theory · Mathematics 2019-02-20 Eric Naslund

According to a popular belief, the decimal digits of mathematical constants such as {\pi} behave like statistically independent random variables, each taking the values 0, 1, 2, 3, 4, 5, 6, 7, 8, and 9 with equal probability of 1/10. If…

Number Theory · Mathematics 2025-04-15 Paula Nataniela Roba , Karlis Podnieks