Let Ω(n) denote the number of prime divisors of n counting multiplicity. One can show that for any positive integer m and all j = 0,1,…,m – 1, we have
with α = 1. Building on work of Kubota and Yoshida, we show that for m > 2 and any j = 0,1,…,m – 1, the error term is not o(xα) for any α < 1.
Email your librarian or administrator to recommend adding this journal to your organisation's collection.
* Views captured on Cambridge Core between September 2016 - 25th March 2017. This data will be updated every 24 hours.