Asymptotic distribution of integers with certain prime factorizations
Abstract
Let p1<p2<... <p<... be the sequence of prime numbers and let m be a positive integer. We give a strong asymptotic formula for the distribution of the set of integers having prime factorizations of the form pmk1pmk2...pmkn with k1 k2... kn. Such integers originate in various combinatorial counting problems; when m=2, they arise as Matula numbers of certain rooted trees.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.