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.
Full Text
Sign-in/Register to access full text options
Published version (Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have