Related papers: On Robin's inequality
The Trudinger-Moser inequality states that for functions $u \in H_0^{1,n}(\Omega)$ ($\Omega \subset \mathbb R^n$ a bounded domain) with $\int_\Omega |\nabla u|^ndx \le 1$ one has $\int_\Omega (e^{\alpha_n|u|^{\frac n{n-1}}}-1)dx \le c…
Let $f$ be an integrable log-concave function on ${\mathbb R^n}$ with the center of mass at the origin. We show that $\int\limits_0^{\infty}f(s\theta)ds\ge e^{-n}\int\limits_{-\infty}^{\infty}f(s\theta)ds$ for every $ \theta\in S^{n-1}$,…
We show for all $1/2 \le \sigma \le 1$ and $t\ge 3$ that $\zeta(\sigma+it)| \le 76.2 t^{4.45 (1-\sigma)^{3/2}}$, where $\zeta$ is the Riemann zeta function. This significantly improves the previous bounds, where $4.45$ is replaced by…
A composite positive integer $n$ has the Lehmer property if $\phi(n)$ divides $n-1,$ where $\phi$ is an Euler totient function. In this note we shall prove that if $n$ has the Lehmer property, then $n\leq 2^{2^{K}}-2^{2^{K-1}}$, where $K$…
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…
We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…
Let phi(n) be Euler's totient function and let sigma(n) be the sum of the positive divisors of n. We show that most phi-values (integers in the range of phi) are not sigma-values and vice versa.
This paper improves the bound on $|S(T)|$. The main result is to show that $|S(T)|\leq 0.111\log T + 0.275\log\log T + 2.450$, which is valid for all $T\geq e$.
Let $F$ be a function in the Selberg class ${\mathcal S}$ and $a$ be a real number not equal to 1/2. Consider the sum $$\lambda_{F}(n,a)=\sum_{\rho}\left[1-\left(\frac{\rho-a}{\rho+a-1}\right)^{n}\right],$$ where $\rho$ runs over the…
The divisor function $\sigma(n)$ sums the divisors of $n$. We call $n$ abundant when $\sigma(n) - n > n$ and perfect when $\sigma(n) - n = n$. I recently introduced the recursive divisor function $a(n)$, the recursive analog of the divisor…
Newman's conjecture (proved by Rodgers and Tao in 2018) concerns a certain family of deformations $\{\xi_t(s)\}_{t \in \mathbb{R}}$ of the Riemann xi function for which there exists an associated constant $\Lambda \in \mathbb{R}$ (called…
We call positive integer n a near-perfect number, if it is sum of all its proper divisors, except of one of them ("redundant divisor"). We prove an Euclid-like theorem for near-perfect numbers and obtain some other results for them.
Let $a(1) >0$, $a(n) \ge 0$ for $n \ge 2$ and $a(n) = O(n^\varepsilon)$ for any $\varepsilon >0$, and put $Z(\sigma + it):= \sum_{n=1}^\infty a(n) n^{-\sigma - it}$ where $\sigma , t \in {\mathbb{R}}$. In the present paper, we show that any…
We show that the sign constancy for the values of certain weighted summatory functions of the von Mangoldt function implies the Riemann hypothesis or the generalized Riemann hypothesis for Dirichlet $L$-functions. While such sign constancy…
Let $P^{\left(\frac 12\right)}(n)$ denote the middle prime factor of $n$ (taking into account multiplicity). More generally, one can consider, for any $\alpha \in (0,1)$, the $\alpha$-positioned prime factor of $n$, $P^{(\alpha)}(n)$. It…
In previous work it was shown that if certain series based on sums over primes of non-principal Dirichlet characters have a conjectured random walk behavior, then the Euler product formula for its $L$-function is valid to the right of the…
The aim of this paper is to give a direct interpretation of the validity of the Riemann hypothesis up to a certain height $T$ in terms of the prime-counting function $\pi(x)$. This is done by proving the well-known explicit Schoenfeld bound…
We generalise the sum-of-divisors-function $\sigma$ and evenness to the rings of integers of certain algebraic number fields. In particular, we present necessary and sufficient conditions for even Eisenstein integers to be (norm-)perfect…
It is proved that $$\left(\frac{x^n}{1-e^{-x}}\right)^{(n)}>0$$ for all $x\in (\log 2, \infty)$ and $n\in \mathbb{N}$, which improves the result of [Al-Musallam and Bustoz in Ramanujan J. 11 (2006) 399-402].
We consider a problem posed by Shparlinski, of giving nontrivial bounds for rational exponential sums over the arithmetic function $\tau(n)$, counting the number of divisors of $n$. This is done using some ideas of Sathe concerning the…