Abstract
We study the asymptotic formula for the sum $\sum_{n\leqslant x}\o(n)$ where $\o(n)$ denotes the number of distinct prime divisors of $n$, and we perform some computations which detect curve patterns in the distribution of a related sequence.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
