2000 character limit reached
On factorizations into coprime parts
Published 1 Feb 2021 in math.NT | (2102.00978v1)
Abstract: Let $f(n)$ and $g(n)$ be the number of unordered and ordered factorizations of $n$ into integers larger than one. Let $F(n)$ and $G(n)$ have the additional restriction that the factors are coprime. We establish the asymptotic bounds for the sums of $F(n){\beta}$ and $G(n){\beta}$ up to $x$ for all real $\beta$ and the asymptotic bounds for $f(n){\beta}$ and $g(n){\beta}$ for all negative $\beta$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.