Abstract

Let $$\Lambda =\{ \lambda _j\}_{j=1}^\infty $$ be a set of positive integers, and let $$p_\Lambda (n)$$ be the number of ways of writing n as a sum of positive integers $$\lambda \in \Lambda $$ such that $$\chi (\lambda )=1$$ and $$f(\lambda ) \equiv j \,\,(\mathrm {mod}\,\, m)$$ , where $$m\ge 1$$ and $$j\ge 0$$ are fixed integers. Here, $$\chi $$ and f are a certain multiplicative function and an additive function, respectively. In this paper, we obtain the asymptotic formula for $$\ln \left( \sum _{n\le x} p_\Lambda (n) \right) \sim \ln p_\Lambda ([x])$$ as $$x\rightarrow \infty $$ .

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.