English
Related papers

Related papers: Inequalities For The Primes Counting Function

200 papers

For $p\in (1,\infty)$ and $\alpha\in\mathbb{R}$, we consider measurable functions $g$ on $\mathbb{S}^{N-1}$ that satisfy the following weighted Hardy inequality: \begin{equation}\label{abs} \int_{\mathbb{R}^N}\frac{ g…

Analysis of PDEs · Mathematics 2026-03-26 Subhajit Roy

In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…

Number Theory · Mathematics 2025-05-13 Akos Magyar , Janos Pintz

We prove two inequalities for the Mittag-Leffler function, namely that the function $\log E_\alpha(x^\alpha)$ is sub-additive for $0<\alpha<1,$ and super-additive for $\alpha>1.$ These assertions follow from two new binomial inequalities,…

Classical Analysis and ODEs · Mathematics 2021-12-16 Stefan Gerhold , Thomas Simon

In this paper we prove mixed inequalities for the maximal operator $M_\Phi$, for general Young functions $\Phi$ with certain additional properties, improving and generalizing some previous estimates for the Hardy-Littlewood maximal operator…

Classical Analysis and ODEs · Mathematics 2019-04-02 Fabio Berra , Marilina Carena , Gladis Pradolini

We verify that $\liminf_{q\to\infty} q\cdot |q|_p\cdot ||qx||<\epsilon$ for all real $x$, small primes $p$ and relatively small $\epsilon$. This result supports the famous $p$-adic Littlewood conjecture which states that the above lower…

Number Theory · Mathematics 2025-06-23 Dmitry Badziahin

We show that for Beurling generalized numbers the prime number theorem in remainder form $$\pi(x) = \operatorname*{Li}(x) + O\left(\frac{x}{\log^{n}x}\right) \quad \mbox{for all } n\in\mathbb{N}$$ is equivalent to (for some $a>0$) $$N(x) =…

Number Theory · Mathematics 2017-08-24 Gregory Debruyne , Jasson Vindas

A Hardy-Littlewood triple is a 3-tuple of integers with the form $(n, n+2, n+6)$. In this paper, we study Hardy-Littlewood triples of the form $(p, P_{a}, P_{b})$ and improve the upper and lower bound orders of it, where $p$ is a prime and…

Number Theory · Mathematics 2024-01-04 Runbo Li

In this paper, among other results, we improve the best known estimates for the constants of the generalized Bohnenblust-Hille inequality. These enhancements are then used to improve the best known constants of the Hardy--Littlewood…

Functional Analysis · Mathematics 2014-08-07 Gustavo Araujo , Daniel Pellegrino

In this paper we characterize the inequality \begin{equation*} \bigg( \int_0^{\infty} \bigg( \int_0^x \big[ T_{u,b}f^* (t)\big]^r\,dt\bigg)^{\frac{q}{r}} w(x)\,dx\bigg)^{\frac{1}{q}} \le C \, \bigg( \int_0^{\infty} \bigg( \int_0^x [f^*…

Functional Analysis · Mathematics 2021-09-15 Rza Mustafayev , Nevin Bilgiçli , Merve Yılmaz

This paper presents a proof of the following conjecture, stated by Nishizawa in [Appl. Math. Comput. 269, (2015), 146--154.]: for $\displaystyle 0<x<\pi/2$ the inequality $ \displaystyle \frac{\sin{x}}{x} \!>\! \left(\frac{2}{\pi} +…

Classical Analysis and ODEs · Mathematics 2019-10-15 Branko Malesevic , Tatjana Lutovac , Bojan Banjac

We show, for any $q\ge 3$ and distinct reduced residues $a,b \pmod q$, the existence of certain hypothetical sets of zeros of Dirichlet $L$-functions lying off the critical line implies that $\pi(x;q,a)<\pi(x;q,b)$ for a set of real $x$ of…

Number Theory · Mathematics 2012-05-01 Kevin Ford , Sergei Konyagin , Youness Lamzouri

This paper makes a fundamental assertion about the Erd\H{o}s-Straus conjecture. Suppose that for a prime $p$ there exists $x,y,z \in \mathbb{N}$ with $x \leq y \leq z$ so that $$ \frac{4}{p} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}. $$ The…

Number Theory · Mathematics 2020-03-04 Kyle Bradford

Let $\mathcal{P}$ be the set of primes and $\pi(x)$ the number of primes not exceeding $x$. Let also $P^+(n)$ be the largest prime factor of $n$ with convention $P^+(1)=1$ and $$ T_c(x)=\#\left\{p\le x:p\in \mathcal{P},P^+(p-1)\ge…

Number Theory · Mathematics 2025-02-19 Yuchen Ding

In this paper we use a theorem first proved by S.W.Golomb and a famous inequality by J.B. Rosser and L.Schoenfeld in order to prove that there exists an exact formula for $\pi(n)$ which holds infinitely often.

Number Theory · Mathematics 2015-11-16 Konstantinos N. Gaitanas

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…

General Mathematics · Mathematics 2008-10-07 Damian Gulich , Gustavo Funes , Nahuel Lofeudo , Leopoldo Garavaglia , Mario Garavaglia

We extend Hardy's inequality from sequences of non-negative numbers to sequences of positive semi-definite operators if the parameter p satisfies 1<p<=2, and to operators under a trace for arbitrary p>1. Applications to trace functions are…

Operator Algebras · Mathematics 2010-01-13 Frank Hansen

Let pi(x) denote the number of primes smaller or equal to x. We compare sqrt{pi}(x) with sqrt{R}(x) and sqrt{li}(x), where R(x) and li(x) are the Riemann function and the logarithmic integral, respectively. We show a regularity in the…

Number Theory · Mathematics 2007-05-23 Erika Alvarez , Jean Pestieau

We generalize current known distribution results on Shanks--R\'enyi prime number races to the case where arbitrarily many residue classes are involved. Our method handles both the classical case that goes back to Chebyshev and function…

Number Theory · Mathematics 2020-04-20 Lucile Devin

The possibility of stating the second law of thermodynamics in terms of the increasing behaviour of a physical property establishes a connection between that branch of physics and the theory of algebraic inequalities. We use this connection…

Statistical Mechanics · Physics 2023-09-07 Andrés Vallejo

Let $p_n$ denote the $n$-th prime. For any $m\geq 1$, there exist infinitely many $n$ such that $p_{n}-p_{n-m}\leq C_m$ for some large constant $C_m>0$, and $$p_{n+1}-p_n\geq \frac{c_m\log n\log\log n\log\log\log\log n}{\log\log\log n}, $$…

Number Theory · Mathematics 2018-02-08 Yu-Chen Sun , Hao Pan
‹ Prev 1 8 9 10 Next ›