Related papers: The Legendre Approximation and Arithmetic Bias

We mathematically prove that an existing linear predictor of baseball teams' winning percentages (Jones and Tappin 2005) is simply just a first-order approximation to Bill James' Pythagorean Won-Loss formula and can thus be written in terms…

We prove {\em sign equidistribution} of Legendre polynomials: the ratio between the lengths of the regions in the interval $[-1, 1]$ where the Legendre polynomial assumes positive versus negative values, converges to one as the degree…

It is a well-known fact that for any natural number $n$, there always exists a prime in $[n, 2n]$. Our aim in this note is to generalize this result to $[n, kn]$. A lower as well as an upper bound on the number of primes in $[n, kn]$ were…

We put a new conjecture on primes from the point of view of its binary expansions and make a step towards justification.

We show that the hereditary discrepancy of homogeneous arithmetic progressions is lower bounded by $n^{1/O(\log \log n)}$. This bound is tight up to the constant in the exponent. Our lower bound goes via proving an exponential lower bound…

Starting from the first Hardy-Littlewood conjecture some topics will be covered: an empirical approach to the distribution of the twin primes in classes mod(10) and a simplified proof of the Bruns theorem . Finally, it will be explored an…

The second Hardy-Littlewood conjecture asserts that the prime counting function $\pi(x)$ satisfies the subadditive inequality \begin{align*} \pi(x+y)\leqslant \pi(x)+\pi (y) \end{align*} for all integers $x,y\geqslant 2$. By linking the…

In this paper we propose an algorithm that correctly discards a set of numbers (from a previously defined sieve) with an interval of integers. Leopoldo's Theorem states that the remaining integer numbers will generate and count the complete…

Let $x,h$ and $Q$ be three parameters. We show that, for most moduli $q\le Q$ and for most positive real numbers $y\le x$, every reduced arithmetic progression $a\mod q$ has approximately the expected number of primes $p$ from the interval…

One aspect of Chebyshev's bias is the phenomenon that a prime number, $ q $, modulo another prime number, $ p$, experimentally seems to be slightly more likely to be a nonquadratic residue than a quadratic residue. We thought it would be…

In classical prime number theory there are several asymptotic formulas said to be "equivalent" to the PNT. One is the bound $M(x) = o(x)$ for the sum function of the Moebius function. For Beurling generalized numbers, this estimate is not…

It is well-known that separation of variables in 2nd order partial differential equations (PDEs) for physical problems with spherical symmetry usually leads to Cauchy's differential equation for the radial coordinate and Legendre's…

We prove that there are arbitrarily long arithmetic progressions of primes. There are three major ingredients. The first is Szemeredi's theorem, which asserts that any subset of the integers of positive density contains progressions of…

The Binomial Theorem has long been essential in mathematics. In one form or another it was known to the ancients and, in the hands of Leibniz, Newton, Euler, Galois, and others, it became an essential tool in both algebra and analysis.…

The cyclicity and Koblitz conjectures ask about the distribution of primes of cyclic and prime-order reduction, respectively, for elliptic curves over $\mathbb{Q}$. In 1976, Serre gave a conditional proof of the cyclicity conjecture, but…

Let $\mathcal{P}$ denote the set of all primes. In 1950, P. Erd\H{o}s conjectured that if $c$ is an arbitrarily given constant, $x$ is sufficiently large and $a_1,\dots , a_t$ are positive integers with $a_1<a_2<\cdot\cdot\cdot<a_t\leqslant…

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…

Central limit theorems (CLTs) have a long history in probability and statistics. They play a fundamental role in constructing valid statistical inference procedures. Over the last century, various techniques have been developed in…

A modified totient function ($\phi_2$) is seen to play a significant role in the study of the twin prime distribution. The function is defined as $\phi_2(n):=\#\{a\le n ~\vert ~\textrm{$a(a+2)$ is coprime to $n$}\}$ and is shown here to…

Mills proved that there exists a real constant $A>1$ such that for all $n\in \mathbb{N}$ the values $\lfloor A^{3^n}\rfloor$ are prime numbers. No explicit value of $A$ is known, but assuming the Riemann hypothesis one can choose $A=…