activity
20182020
most citedThe number of integer points close to a polynomial

1 citations · 1 across the 5 of their papers we have counts for

collaborators
Showing math.NTShow all

7 papers · 1 filter

math.NT2020

A hybrid inequality for the number of divisors of an integer

Patrick Letendre

We establish an explicit inequality for the number of divisors of an integer . It uses the size of and its number of distinct prime divisors.

math.NT2019

Polynomials with integer roots

Patrick Letendre

Let be the set of unitary polynomials of degree that have their roots in . We note We show that…

math.NT2019

Subsets of with only small products or ratios

Patrick Letendre

Let be a fixed prime. We estimate the number of elements of a set for which $$ s_1s_2 \equiv a \pmod{p} \quad \mbox{for some}\quad a \in [-X,X] \qu…

math.NT2019

Truncated convolution of Möbius function and multiplicative energy of an integer

Patrick Letendre

We establish an interesting upper bound for the moments of truncated Dirichlet convolution of Möbius function, a function noted . Our result implies that is usuall…

math.NT20191 cited

The number of integer points close to a polynomial

Patrick Letendre

Let be a polynomial of degree with real coefficients and let and be real numbers. Let be the distance to the nearest integer. We obt…

math.NT2018

New upper bounds for the number of divisors function

Jean-Marie De Koninck, Patrick Letendre

Let stand for the number of divisors of the positive integer . We obtain upper bounds for in terms of and the number of distinct prime factors of .