Related papers: On the first sign change in Mertens' Theorem

We establish why li(x) outperforms x/log x as an estimate for the prime counting function pi(x). The result follows from subdividing the natural numbers into the intervals s_k :={p_k^2,..., p_{k+1}^2-1}, k>=1, each being fully sieved by the…

This paper is devoted to study some expressions of the type $\prod_{p} p^{\lfloor\frac{x}{f(p)}\rfloor}$, where $x$ is a nonnegative real number, $f$ is an arithmetic function satisfying some conditions, and the product is over the primes…

The recent technique for estimating lower bounds of the prime counting function $\pi(x)=#\{p \leq x: p\text{ prime}\}$ by means of the irrationality measures $\mu(\zeta(s)) \geq 2$ of special values of the zeta function claims that $\pi(x)…

We establish some monotonicity results and functional inequalities for modified Lommel functions of the first kind. In particular, we obtain new Tur\'{a}n type inequalities and bounds for ratios of modified Lommel functions of the first…

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…

This work is devoted to the study of first order linear problems with involution and periodic boundary value conditions. We first prove a correspondence between a large set of such problems with different involutions to later focus our…

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,…

Let $A\subset [1,x]$ be a non-empty set of primes with $|A|= \alpha x(\log x)^{-1}$. We prove that there exist absolute constants $c_1,c_2>0$ such that, as $x$ gets sufficiently large, we have $|A+A|\geq c_1(\log x)(\log \log…

We analyze Jim Propp's P-machine, a simple deterministic process that simulates a random walk on $Z^d$ to within a constant. The proof of the error bound relies on several estimates in the theory of simple random walks and some careful…

Given an arithmetic function $g(n)$ write $M_g(x) := \sum_{n \leq x} g(n)$. We extend and strengthen the results of a fundamental paper of Hal\'{a}sz in several ways by proving upper bounds for the ratio of $\frac{|M_g(x)|}{M_{|g|}(x)}$,…

We will prove several congruences modulo a power of a prime such as $$ \sum_{0<k_1<...<k_{n}<p}\leg{p-k_{n}}{3} {(-1)^{k_{n}}\over k_1... k_{n}}\equiv {lll} -{2^{n+1}+2\over 6^{n+1}} p B_{p-n-1}({1\over 3}) &\pmod{p^2} &{if $n$ is odd}…

Let $G(X)$ denote the size of the largest gap between consecutive primes below $X$. Answering a question of Erdos, we show that $$G(X) \geq f(X) \frac{\log X \log \log X \log \log \log \log X}{(\log \log \log X)^2},$$ where $f(X)$ is a…

The behaviour of the generalised Riesz function defined by \[S_{m,p}(x)=\sum_{k=0}^\infty \frac{(-)^{k-1}x^k}{k! \zeta(mk+p)}\qquad (m\geq 1,\ p\geq 1)\] is considered for large positive values of $x$. A numerical scheme is given to compute…

This note presents a result on the maximal prime gap of the form p_(n+1) - p_n <= C(log p_n)^(1+e), where C > 0 is a constant, for any arbitrarily small real number e > 0, and all sufficiently large integer n > n_0. Equivalently, the result…

Let $f$ be a non-CM Hecke eigencusp form of level 1 and fixed weight, and let $\{\lambda_f(n)\}_n$ be its sequence of normalized Fourier coefficients. We show that if $K/ \mathbb{Q}$ is any number field, and $\mathcal{N}_K$ denotes the…

We provide an elementary proof of the left side inequality and improve the right inequality in \bigg[\frac{n!}{x-(x^{-1/n}+\alpha)^{-n}}\bigg]^{\frac{1}{n+1}}&<((-1)^{n-1}\psi^{(n)})^{-1}(x)…

Let $p$ be an odd prime. For each integer $a$ with $p\nmid a$, the famous Zolotarev's Lemma says that the Legendre symbol $(\frac{a}{p})$ is the sign of the permutation of $\Z/p\Z$ induced by multiplication by $a$. The extension of…

In this note, we establish a multiplicity theorem for a nonlocal discrete problem of the type $$\cases{-\left(a\sum_{m=1}^{n+1}|x_m-x_{m-1}|^2+b\right)(x_{k+1}-2x_k+x_{k-1})=h_k(x_k)\hskip 10pt k=1,...,n, \cr & \cr x_0=x_{n+1}=0\cr}$$…

The epsilon operator is a term-forming operator which replaces quantifiers in ordinary predicate logic. The application of this undervalued formalism has been hampered by the absence of well-behaved proof systems on the one hand, and…

For a half-integral weight modular form $f = \sum_{n=1}^{\infty} a_f(n)n^{\frac{k-1}{2}} q^n$ of weight $k = l +\frac{1}{2}$ on $\Gamma_0(4)$ such that $a_f(n)$ ($n$ $\in$ $\mathbb{N}$) are real, we prove for a fixed suitable natural number…