Integers With A Predetermined Prime Factorization

arXiv1203.2363MaRDI QIDQ6231565FDOQ6231565

Eric Naslund

Publication date: 11 March 2012

Abstract: A classic question in analytic number theory is to find asymptotics for $sigm{a}_k(x)$ and $p{i}_k(x)$, the number of integers $nleqx$ with exactly $k$ prime factors, where $p{i}_k(x)$ has the added constraint that all the factors are distinct. This problem was originally resolved by Landau in 1900, and much work was subsequently done where $k$ is allowed to vary. In this paper we look at a similar question about integers with a specific prime factorization. Given $$, $$ let $$ denote the number of integers of the form $n=p_1^{alph{a}_1}\mathrm{...}{p}_k^{alph{a}_k}$ where the $p_i$ are not necessarily distinct, and let $$ denote the same counting function with the added condition that the factors are distinct. Our main result is asymptotics for both of these functions.

This page was built for publication: Integers With A Predetermined Prime Factorization

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