English
Related papers

Related papers: The Legendre Approximation and Arithmetic Bias

200 papers

The Twin Prime conjecture states that there are infinitely many pairs of distinct primes which differ by $2$. Until recently this conjecture had seemed to be far out of reach with current techniques. However, in April 2013, Yitang Zhang…

Number Theory · Mathematics 2014-10-31 Andrew Granville

We study the prime pair counting functions $\pi_{2k}(x),$ and their averages over $2k.$ We show that good results can be achieved with relatively little effort by considering averages. We prove an asymptotic relation for longer averages of…

Number Theory · Mathematics 2016-05-17 Jori Merikoski

We studied two probabilistic models of the distribution of primes in the natural number [1].The paper considers the third probabilistic model of the distribution of primes in the natural number. The author proved that the results obtained…

Number Theory · Mathematics 2015-09-30 Victor Volfson

Proposed in 1937, the Collatz conjecture has remained in the spotlight for mathematicians and computer scientists alike due to its simple proposal, yet intractable proof. In this paper, we propose several novel theorems, corollaries, and…

Number Theory · Mathematics 2021-06-16 Michael R. Schwob , Peter Shiue , Rama Venkat

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

The ternary Goldbach conjecture, or three-primes problem, states that every odd number $n$ greater than $5$ can be written as the sum of three primes. The conjecture, posed in 1742, remained unsolved until now, in spite of great progress in…

Number Theory · Mathematics 2014-04-15 Harald Andrés Helfgott

We prove an asymptotic formula for the number of integers $\leq x$ which can be written as the product of $k ~(\geq 2)$ distinct primes $p_1\cdots p_k$ with each prime factor in an arithmetic progression $p_j\equiv a_j \bmod q$, $(a_j,…

Number Theory · Mathematics 2018-02-21 Xianchang Meng

Prime numbers are one of the most intriguing figures in mathematics. Despite centuries of research, many questions remain still unsolved. In recent years, computer simulations are playing a fundamental role in the study of an immense…

History and Overview · Mathematics 2020-02-04 Alberto Fraile , Roberto Martinez , Daniel Fernandez

Each number field has an associated finite abelian group, the class group, that records certain properties of arithmetic within the ring of integers of the field. The class group is well-studied, yet also still mysterious. A central…

Number Theory · Mathematics 2022-06-17 Lillian B. Pierce

Prime numbers seem to distribute among the natural numbers with no other law than that of chance, however its global distribution presents a quite remarkable smoothness. Such interplay between randomness and regularity has motivated sci-…

Number Theory · Mathematics 2008-11-21 Bartolo Luque , Lucas Lacasa

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

Number Theory · Mathematics 2022-04-18 Michaela Cully-Hugill , Adrian W. Dudek

The moments of the coefficients of elliptic curve L-functions are related to numerous arithmetic problems. Rosen and Silverman proved a conjecture of Nagao relating the first moment of one-parameter families satisfying Tate's conjecture to…

We show the following bounds on the prime counting function $\pi(x)$ using principles from analytic number theory, giving an estimate: $$2 \log 2 \geq \limsup_{x \rightarrow \infty} \frac{\pi(x)}{x / \log x} \geq \liminf_{x \rightarrow…

Number Theory · Mathematics 2020-12-03 Connor Paul Wilson

It is known that there are infinitely-many prime numbers which take the form of a polynomial of degree one with integer coefficients, this is Dirichlet's theorem. We use an elementary sieving argument together with bounds on the prime…

Number Theory · Mathematics 2017-07-24 Acquaah Peter

Withdrawn by the authors due to an error in the proof of the finite field result (Thm. 1.5): The random primes used in the proof need NOT avoid the exceptional primes from Lemma 2.7, thus leaving Thm. 1.5 unproved.

Number Theory · Mathematics 2010-01-24 Ashraf Ibrahim , J. Maurice Rojas , Korben Rusek

We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…

General Mathematics · Mathematics 2017-09-19 Joram Soch

Let $q > 2$ be a prime number and define $\lambda_q := \left( \frac{\tau}{q} \right)$ where $\tau(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $\tau(n)$ is a quadratic residue modulo…

Number Theory · Mathematics 2017-01-10 Olivier Bordellès

We provide approximations to the prime counting function by various discretized versions of the logarithmic integral function, expressed solely in terms of the harmonic numbers. We demonstrate with explicit error bounds that these…

Number Theory · Mathematics 2021-01-05 Jesse Elliott

In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…

Number Theory · Mathematics 2020-05-14 Youssef Lazar

We calculate the triple correlations for the truncated divisor sum $\lambda_{R}(n)$. The $\lambda_{R}(n)$'s behave over certain averages just as the prime counting von Mangoldt function $\Lambda(n)$ does or is conjectured to do. We also…

Number Theory · Mathematics 2007-05-23 D. A. Goldston , C. Y. Yildirim