Publication

On the distribution of squarefree integers in arithmetic progressions

Pierre Francis André Le Boudec
2018
Journal Articles

Abstract

investigate the error term of the asymptotic formula for the number of squarefree integers up to some bound, and lying in some arithmetic progression a (mod q). In particular, we prove an upper bound for its variance as a varies over (Z/qZ)(x) which considerably improves upon earlier work of Blomer.

Official source

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the distribution of squarefree integers in arithmetic progressions

Chat with Graph Search

A story of two transitions: From adhesive to abrasive wear and from ductile to brittle regime

Effects of Hyporheic Exchange and Settlement on the Particle Size Distribution of Colloids

Extensions of Peer Prediction Incentive Mechanisms