Related papers: Primes, Pi, and Irrationality Measure

In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…

For the old question whether there is always a prime in the interval [kn, (k+1)n] or not, the famous Bertrand's postulate gave an affirmative answer for k=1. It was first proved by P.L. Chebyshev in 1850, and an elegant elementary proof was…

We present a brief survey of the methods used in deducing upper estimates for irrationality measures of the logarithm values. We particularly expose the best known estimates for $\log2$ (due to E. Rukhadze), $\pi$ (due to M. Hata) and…

Let $\alpha$ be a real number such that $1< \alpha <2$ and let $x_0=x_0(\alpha)$ be a {\rm(}unique{\rm)} positive solution of the equation $$ x^{\alpha-1} -\frac{\pi}{e^2\sqrt{3}}x +1=0. $$ Then we prove that for each positive integer…

A subset of the integers larger than 1 is $primitive$ if no member divides another. Erdos proved in 1935 that the sum of $1/(a\log a)$ for $a$ running over a primitive set $A$ is universally bounded over all choices for $A$. In 1988 he…

An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…

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…

Building upon ideas of the second and third authors, we prove that at least $2^{(1-\varepsilon)\frac{\log s}{\log\log s}}$ values of the Riemann zeta function at odd integers between 3 and $s$ are irrational, where $\varepsilon$ is any…

From known effective bounds on the prime counting function of the form \[ |\pi(x)-\mathrm{Li}(x)| < a \;x \;(\ln x)^{b} \; \exp\left(-{c}\; \sqrt{\ln x}\right); \qquad (x \geq x_0); \] it is possible to establish exponentially tight…

We give a proof of the irrationality of the $p$-adic zeta-values $\zeta_p(k)$ for $p=2,3$ and $k=2,3$. Such results were recently obtained by F.Calegari as an application of overconvergent $p$-adic modular forms. In this paper we present an…

Many questions in experimental mathematics are fundamentally inductive in nature. Here we demonstrate how Bayesian inference --the logic of partial beliefs-- can be used to quantify the evidence that finite data provide in favor of a…

Let \(u\neq \pm 1,v^2\) be a fixed integer, let \(p\geq 2\) be a prime, and let $\text{ord}_p(u) \mid p-1$ be the multiplicative order of $u \text{ mod } p$. Define a prime counting function by $\pi(u,x)=\# \{ p\leq x:\text{ord}_p(u)=p-1…

The Euler product formula relates Dirichlet $L(s,\chi)$ functions to an infinite product over primes, and is known to be valid for $\Re (s) >1$, where it converges absolutely. We provide arguments that the formula is actually valid for $\Re…

We study generalizations of some results of Jean-Louis Nicolas regarding the relation between small values of Euler's function $\varphi(n)$ and the Riemann Hypothesis. Among other things, we prove that for $1\leq q\leq 10$ and for $q=12,…

We consider a generalization of Euclid's proof of the infinitude of primes and show that it leads to variants of the Euclid-Mullin sequence that provably contain every prime number.

Measures of irrationality are a numerical way of quantifying how far a given variety is from being rational (or rationally connected, uniruled, etc.). In the last two decades, there has been renewed interest in the study of these…

Let $\phi(n)$ be the Euler totient function and $\phi_k(n)$ its $k$-fold iterate. In this note, we improve the upper bound for the number of positive $n\leqslant x$ such that $\phi_{k+1}(n)\geqslant cn$. Comparing with the upper bound which…

Let $p,p_1,\ldots,p_m$ be positive integers with $p_1\leq p_2\leq\cdots\leq p_m$ and $x\in [-1,1)$, define the so-called Euler type sums ${S_{{p_1}{p_2} \cdots {p_m},p}}\left( x \right)$, which are the infinite sums whose general term is a…

For $n \geq 3,$ let $ p_n $ denote the $n^{\rm th}$ prime number. Let $[ \; ]$ denote the floor or greatest integer function. For a positive integer $m,$ let $\pi_2(m)$ denote the number of twin primes not exceeding $m.$ The twin prime…

Defining a Beukers [1] like integral for $\zeta(5)$ as \begin{equation*} I_n:=\int_{(0,1)^5}\frac{(1-x_3)^n(1-x_4)^n P_n(x_1)P_n(x_2)}{1-(1-x_1x_2x_3x_4)x_5} \ dx_1dx_2dx_3dx_4dx_5 \end{equation*} we prove that for each $n\in\mathbb{N}$…