On square-free numbers generated from given sets of primes II

From MaRDI portal




Abstract: We progress with the investigation started in article cite{Roman2022}, namely the analysis of the asymptotic behaviour of QmathcalP(x) for different sets mathcalP, where QmathcalP(x) is the element count of the set containing those positive square-free integers, which are smaller than-, or equal to x, and which are only divisible by the elements of mathcalP. We study how QmathcalP(x) behaves when we require that chi(p)=1 must hold for every pinmathcalP, where chi is a Dirichlet character.














This page was built for publication: On square-free numbers generated from given sets of primes II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6422714)