Papers
Topics
Authors
Recent
2000 character limit reached

Entiers ultrafriables en progressions arithmétiques

Published 13 Jan 2020 in math.NT | (2001.04435v1)

Abstract: A natural integer is called $y$-ultrafriable if none of the prime powers occurring in its canonical decomposition exceed $y$. We investigate the distribution of $y$-ultrafriable integers not exceeding $x$ among arithmetic progressions to the modulus $q$. Given a sufficiently small, positive constant $\varepsilon$, we obtain uniform estimates valid for $q\leqslant y{c/\log_2y}$ whenever $\log y\leqslant (\log x)\varepsilon$, and for $q\leqslant \sqrt{y}$ if $(\log x){2+\varepsilon}\leqslant y\leqslant x$.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.