English
Related papers

Related papers: Integers with a large smooth divisor

200 papers

Let $n$ be a positive integer and $f_n(x)= 1+x+\frac{x^2}{2!}+\cdots + \frac{x^n}{n!}$ denote the $n$-th Taylor polynomial of the exponential function. Let $K = \mathbf{Q}(\theta)$ be an algebraic number field where $\theta$ is a root of…

Number Theory · Mathematics 2023-10-19 Anuj Jakhar , Srinivas Kotyada

The $j$th divisor function $d_j$, which counts the ordered factorisations of a positive integer into $j$ positive integer factors, is a very well-known arithmetic function; in particular, $d_2(n)$ gives the number of divisors of $n$.…

Number Theory · Mathematics 2018-06-05 S. L. Hill , M. N. Huxley , M. C. Lettington , K. M. Schmidt

We begin by defining functions $\sigma_{t,k}$, which are generalized divisor functions with restricted domains. For each positive integer $k$, we show that, for $r>1$, the range of $\sigma_{-r,k}$ is a subset of the interval…

Number Theory · Mathematics 2017-04-11 Colin Defant

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

Number Theory · Mathematics 2019-01-25 Fabián Arias , Jerson Borja , Luis Rubio

We show that analytic torsion of smooth theta divisor is represented by a Siegel modular form characterizing the Andreotti-Mayer locus if its dimension is positive.

Algebraic Geometry · Mathematics 2007-05-23 Ken-Ichi Yoshikawa

We show that there are infinitely many primes $p$ such that $p-1$ is divisible by a square $d^2 \geq p^\theta$ for $\theta=1/2+1/2000.$ This improves the work of Matom\"aki (2009) who obtained the result for $\theta=1/2-\varepsilon$ (with…

Number Theory · Mathematics 2020-11-03 Jori Merikoski

The prime divisors of a polynomial $P$ with integer coefficients are those primes $p$ for which $P(x) \equiv 0 \pmod{p}$ is solvable. Our main result is that the common prime divisors of any several polynomials are exactly the prime…

Number Theory · Mathematics 2020-06-02 Olli Järviniemi

In this paper we introduce a new diophantine equation with prime numbers. Let $[\, \cdot\,]$ be the floor function. We prove that when $1<c<\frac{23}{21}$ and $\theta>1$ is a fixed, then every sufficiently large positive integer $N$ can be…

Number Theory · Mathematics 2021-11-05 S. I. Dimitrov

We investigate the distribution of the digits of quotients of randomly chosen positive integers taken from the interval $[1,T]$, improving the previously known error term for the counting function as $T\to+\infty$. We also resolve some…

Number Theory · Mathematics 2021-05-19 Alessandro Gambini , Remis Tonon , Alessandro Zaccagnini

For $x\ge0$ let $\pi(x)$ be the number of primes not exceeding $x$. The asymptotic behaviors of the prime-counting function $\pi(x)$ and the $n$-th prime $p_n$ have been studied intensively in analytic number theory. Surprisingly, we find…

Number Theory · Mathematics 2016-02-26 Zhi-Wei Sun

In the late eighties, Hildebrand and Tenenbaum proved an asymptotic formula for the number of positive integers below $x$, having exactly $\nu$ distinct prime divisors: $\pi_{\nu}(x) \sim x \delta_{\nu}(x)$. Here we consider the restricted…

Number Theory · Mathematics 2025-12-12 Jacques Benatar

We study the extent to which divisors of a typical integer $n$ are concentrated. In particular, defining the Erd\H{o}s-Hooley $\Delta$-function by $\Delta(n) := \max_t \# \{d | n, \log d \in [t,t+1]\}$, we show that $\Delta(n) \geq (\log…

Number Theory · Mathematics 2023-11-01 Kevin Ford , Ben Green , Dimitris Koukoulopoulos

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the…

Number Theory · Mathematics 2026-04-17 Alice Bazzanella , Carlo Sanna

We show tight bounds for both online integer multiplication and convolution in the cell-probe model with word size w. For the multiplication problem, one pair of digits, each from one of two n digit numbers that are to be multiplied, is…

Data Structures and Algorithms · Computer Science 2012-02-27 Raphael Clifford , Markus Jalsenius

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…

Number Theory · Mathematics 2022-09-28 Takashi Nakamura

We estimate the sizes of the sumset A + A and the productset A $\cdot$ A in the special case that A = S (x, y), the set of positive integers n less than or equal to x, free of prime factors exceeding y.

Number Theory · Mathematics 2010-10-19 William D. Banks , David Covert

We use partial zeta functions to analyse the asymptotic behaviour of certain smooth arithmetical sums over smooth k-free integers.

Number Theory · Mathematics 2019-12-30 Francesco Cellarosi , M. Ram Murty

For any relatively prime integers $r$ and $s$, let $a_{r,s}(n)$ denote the number of $(r,s)$-regular partitions of a positive integer of $n$ into distinct parts. Prasad and Prasad (2018) proved many infinite families of congruences modulo 2…

Number Theory · Mathematics 2021-07-01 Rinchin Drema , Nipen Saikia

We study equations of the form $\sigma(p^{q-1})=Az$, where $p$ is a prime, $q$ is a fixed odd prime, $A$ is a fixed integer and $z$ is an integer composed of primes in a fixed finite set. We shall improve upper bounds for the size and the…

Number Theory · Mathematics 2007-05-23 Tomohiro Yamada

Let $1=d_{1}<d_{2}< \cdots < d_{\tau(n)}=n$ denote the ordered sequence of the positive divisors of an integer $n$. We are interested in estimating the arithmetic function $$ V(n) := \prod_{1 \le i < j \le \tau(n)}(d_{j}-d_{i}) \quad (n \ge…

Number Theory · Mathematics 2025-10-07 Patrick Letendre