English
Related papers

Related papers: An effective estimate for the sum of two cubes pro…

200 papers

A $\textit{square-full}$ number is a positive integer for which all its prime divisors divide itself at least twice. The counting function of square-full integers of the form $f(n)$ for $n\leqslant N$ is denoted by…

Number Theory · Mathematics 2026-01-14 Watcharakiete Wongcharoenbhorn , Yotsanan Meemark

Let $\sigma(n)$ denotes the sum of divisors function of a positive integer $n$. Robin proved that the Riemann hypothesis is true if and only if the inequality $\sigma(n) < e^{\gamma}n \log \log n$ holds for every positive integer $n \geq…

Number Theory · Mathematics 2021-11-01 Christian Axler

We establish completely log-free bounds for exponential sums over the primes and the M\"{o}bius function. Let $0<\eta \leq 1/10$, and suppose $\alpha = a/q + \delta/x$, with $(a,q)=1$ and $|\delta| \leq x^{1/5 + \eta}/q$, and set $\delta_0…

Number Theory · Mathematics 2026-01-28 Priyamvad Srivastav

Let $\|n\|$ stand for the integer complexity of the number $n$, i.e. for the least number of $1$'s needed to write $n$ using arbitrary many additions, multiplications, and parentheses. The two-sided inequality $3\log_3 n\leq\|n\|\leq…

Number Theory · Mathematics 2026-05-01 Sergei Konyagin , Kristina Oganesyan

A well known result of Newman says that upto a limit, multiples of $3$ with even number of 1's in binary representation always exceed multiples of $3$ with odd number of 1's. The phenomenon of preponderance of even number of 1's is now…

Number Theory · Mathematics 2015-11-11 Sai Teja Somu

Some new results concerning the equation $\sigma(N)=aM, \sigma(M)=bN$ are proved. As a corollary, there are only finitely many odd superperfect numbers with a fixed number of distinct prime factors.

Number Theory · Mathematics 2020-10-21 Tomohiro Yamada

For a large class (heuristically most) of irreducible binary cubic forms $F(x,y) \in \mathbb Z[x,y]$, Bennett and Dahmen proved that the generalized superelliptic equation $F(x,y)=z^l$ has at most finitely many solutions in $x,y \in \mathbb…

Number Theory · Mathematics 2020-04-20 George Catalin Turcas

We study exponential sums of the form $\sum_{n=1}^N e^{2\pi i a b^n/m}$ for non-zero integers $a,b,m$. Classically, non-trivial bounds were known for $N\ge \sqrt{m}$ by Korobov, and this range has been extended significantly by Bourgain as…

Number Theory · Mathematics 2016-06-28 Joseph Vandehey

Let $m$, $n$ be positive integers such that $m>n$, $\gcd(m,n)=1$ and $m \not\equiv n \bmod 2$. In 1956, L. Je\'smanowicz \cite{Jes} conjectured that the equation $(m^2 - n^2)^x + (2mn)^y = (m^2+n^2)^z$ has only the positive integer solution…

Number Theory · Mathematics 2018-11-05 Maohua Le

We give new bounds for $\sum_{{a, m ,n}}\alpha_{m}\beta_n\nu_a {\textrm e}\left(\frac{a\overline m}{n}\right)$ where $\alpha_{m}$, $\beta_n$ and $\nu_a$ are arbitrary coefficients, improving upon a result of Duke, Friedlander and Iwaniec…

Number Theory · Mathematics 2018-03-19 Sandro Bettin , Vorrapan Chandee

We give two simple algorithms for the evaluation of difference between the numbers of multiples of 3 with even and odd binary digit sums in interval [0,x), and give an elementary proof of Coquet's sharp estimates for it.

Number Theory · Mathematics 2012-09-18 Vladimir Shevelev

We prove an exponential upper bound for the number $f(m,n)$ of all maximal triangulations of the $m\times n$ grid: \[ f(m,n) < 2^{3mn}. \] In particular, this improves a result of S. Yu. Orevkov (1999).

Combinatorics · Mathematics 2007-05-23 Emile E. Anclin

In this paper we study the problem of detecting prime numbers between all consecutive cubes. Firstly, we use a large computation to show that there is always a prime between $n^3$ and $(n+1)^3$ for $n^3\leq 1.649\cdot 10^{40}$. In addition,…

Number Theory · Mathematics 2026-03-17 Daniel R. Johnston , Jonathan P. Sorenson , Simon N. Thomas , Jonathan E. Webster

We establish an improved upper bound for the number of incidences between m points and n circles in three dimensions. The previous best known bound, originally established for the planar case and later extended to any dimension $\ge 2$, is…

Combinatorics · Mathematics 2019-02-20 Micha Sharir , Adam Sheffer , Joshua Zahl

Given a smooth closed Riemannian manifold $(M,g)$ of dimension $N \ge 3$, we derive sharp quantitative stability estimates for nonnegative functions near the solution set of the Yamabe problem on $(M,g)$. The seminal work of Struwe (1984)…

Analysis of PDEs · Mathematics 2024-05-14 Haixia Chen , Seunghyeok Kim

We show that if $N\pm 1=M\varphi(N)$ with $N\neq 15, 255$ composite, then $M<15.76515\log\log\log N$ and $M<16.03235\log\log\omega(N)$, together with similar results for the unitary totient function, Dedekind function, and the sum of…

Number Theory · Mathematics 2023-09-15 Tomohiro Yamada

We will give new upper bounds for the number of solutions to the inequalities of the shape $|F(x , y)| \leq h$, where $F(x , y)$ is a sparse binary form, with integer coefficients, and $h$ is a sufficiently small integer in terms of the…

Number Theory · Mathematics 2022-07-19 Shabnam Akhtari , Paloma Bengoechea

We obtain asymptotic formulas with remainder terms for the hyperbolic summations $\sum_{mn\le x} f((m,n))$ and $\sum_{mn\le x} f([m,n])$, where $f$ belongs to certain classes of arithmetic functions, $(m,n)$ and $[m,n]$ denoting the gcd and…

Number Theory · Mathematics 2021-05-31 Randell Heyman , László Tóth

We determine all triples $(a,b,n)$ of positive integers such that $a$ and $b$ are relatively prime and $n^k$ divides $a^n + b^n$ (respectively, $a^n - b^n$), when $k$ is the maximum of $a$ and $b$ (in fact, we answer a slightly more general…

Number Theory · Mathematics 2013-11-20 Salvatore Tringali

We prove that if an orientable 3-manifold $M$ admits a complete Riemannian metric whose scalar curvature is positive and has at most $C$-quadratic decay at infinity for some $C > \frac{2}{3}$, then it decomposes as a (possibly infinite)…

Differential Geometry · Mathematics 2025-08-29 Shuli Chen