English
Related papers

Related papers: Improved bounds on Brun's constant

200 papers

In 1845, Bertrand conjectured that twice any prime strictly exceeds the next prime. Tchebichef proved Bertrand's postulate in 1850. In 1934, Ishikawa proved a stronger result: the sum of any two consecutive primes strictly exceeds the next…

Number Theory · Mathematics 2024-06-14 Joel E. Cohen

We generalize the notion of Davenport constants to a `higher degree' and obtain various lower and upper bounds, which are sometimes exact as is the case for certain finite commutative rings of prime power cardinality. Two simple examples…

Combinatorics · Mathematics 2022-02-15 Yair Caro , Benjamin Girard , John R. Schmitt

For each $n=0,1,2,\ldots$, the central trinomial coefficient $T_n$ is the coefficient of $x^n$ in the expansion of $(x^2+x+1)^n$. Let $p>3$ be a prime, and let $n$ be any positive integer. In 2016, the second author conjectured that the…

Number Theory · Mathematics 2026-03-16 Hao Pan , Zhi-Wei Sun

In this note, pointwise best-possible (lower and upper) bounds on the set of copulas with a given value of the Gini's gamma coefficient are established. It is shown that, unlike the best-possible bounds on the set of copulas with a given…

Statistics Theory · Mathematics 2025-01-14 Manuel Úbeda-Flores

In this paper, we prove the twin prime conjecture showing that \begin{align} \sum \limits_{\substack{p\leq x\\p,p+2\in \mathbb{P}}}1\geq (1+o(1))\frac{x}{2\mathcal{C}\log^2 x}\nonumber \end{align} where $\mathcal{C}:=\mathcal{C}(2)>0$ fixed…

General Mathematics · Mathematics 2026-03-10 Theophilus Agama

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…

Number Theory · Mathematics 2019-11-22 Gregory Debruyne , Harold G. Diamond , Jasson Vindas

We estimate the error term in the asymptotic formula of the Sidon constant for (ordinary) Dirichlet polynomials by providing explicit lower and upper bounds. The lower bound is already implicitly known, but we supply the necessary…

Number Theory · Mathematics 2014-06-24 Ole Fredrik Brevig

In this paper we establish some new congruences involving central binomial coefficients as well as Catalan numbers. Let $p$ be a prime and let $a$ be any positive integer. We determine $\sum_{k=0}^{p^a-1}\binom{2k}{k+d}$ mod $p^2$ for…

Number Theory · Mathematics 2011-06-03 Zhi-Wei Sun , Roberto Tauraso

We study the regularity of the $p$-Poisson equation $$ \Delta_p u = h, \quad h\in L^q $$ in the plane. In the case $p>2$ and $2<q<\infty$ we obtain the sharp H\"older exponent for the gradient. In the other cases we come arbitrarily close…

Analysis of PDEs · Mathematics 2013-12-16 Erik Lindgren , Peter Lindqvist

We give elementary proofs for the Apagodu-Zeilberger-Stanton-Amdeberhan-Tauraso congruences $$\sum\limits_{n=0}^{p-1}\dbinom{2n}{n} \equiv\eta_{p}\mod p^{2},$$ $$\sum\limits_{n=0}^{rp-1}\dbinom{2n}{n}…

Combinatorics · Mathematics 2019-01-31 Darij Grinberg

For $p\in (1,+\infty)$ and $b \in (0, +\infty]$ the $p$-torsion function with Robin boundary conditions associated to an arbitrary open set $\Om \subset \R^m$ satisfies formally the equation $-\Delta_p =1$ in $\Om$ and $|\nabla u|^{p-2}…

Analysis of PDEs · Mathematics 2017-03-31 M. van den Berg , D. Bucur

We are interested to bound from below the number of distinct dot products determined by a finite set of points $P$ in the Euclidean plane. In this paper, we build on the work of B. Hanson, O. Roche-Newton, and S. Senger, to obtain the…

Combinatorics · Mathematics 2025-02-19 Michalis Kokkinos

For the past two years, measurements have been performed with a watt balance at the National Institute of Standards and Technology (NIST) to determine the Planck constant. A detailed analysis of these measurements and their uncertainties…

By establishing an improved level of distribution we study almost primes of the form $f(p,n)$ where $f$ is an irreducible binary form over $\mathbb Z$.

Number Theory · Mathematics 2015-09-23 A. J. Irving

We compute the exact John--Nirenberg constant of ${\rm BMO}^p((0,1))$ for $1\le p\le 2,$ which has been known only for $p=1$ and $p=2.$ We also show that this constant is attained in the weak-type John--Nirenberg inequality and obtain a…

Classical Analysis and ODEs · Mathematics 2015-06-17 Leonid Slavin

For n=1,2,3,... let p_n be the n-th prime. We mainly show that p_n>n+sum_{k=1}^n p_k/k for all n>124, and sum_{k=1}^n kp_k<n^2p_n/3 for all n>30.

Number Theory · Mathematics 2012-09-20 Zhi-Wei Sun

An upper bound for the Lebesgue constant (the supremum norm) of the operator of interpolation of a function in equally spaced points of a triangle by a polynomial of total degree less than or equal to n is obtained. Earlier, the rate of…

Numerical Analysis · Mathematics 2022-09-22 N Baidakova

Let $p_n$ denote the $n$-th prime. In 2000, Panaitopol established the inequality $p_1 \cdots p_n > p_{n+1}^{n - \pi(n)}$ for all $n \geq 2$, where $\pi(x)$ is the prime counting function. In 2021, Yang and Liao refined this by introducing…

Number Theory · Mathematics 2025-11-18 Diego Marques , Pavel Trojovsky

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

Number Theory · Mathematics 2017-12-29 Aleksei S. Volostnov

We present a review of results that have been obtained in the past twenty-five years concerning the $L^p$-Hardy inequality with distance to the boundary. We concentrate on results where the best Hardy constant is either computed exactly or…

Analysis of PDEs · Mathematics 2023-11-15 Gerassimos Barbatis
‹ Prev 1 8 9 10 Next ›