English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Let $\omega(n)$ (resp. $\Omega(n)$) denote the number of prime divisors(resp. with multiplicity) of a natural number $n$. In 1917, Hardy and Ramanujanproved that the normal order of $\omega(n)$ is $\log\log n$, and the same istrue of $\Omega(n)$; roughly speaking, a typical natural number $n$ has about$\log\log n$ prime factors. We prove a similar result for $\omega(s(n))$, where$s(n)$ denotes the sum of the proper divisors of $n$: For any $\epsilon > 0$and all $n \leq x$ not belonging to a set of size $o(x)$, \[ |\omega(s(n)) -\log\log s(n)| < \epsilon \log\log s(n) \] and the same is true for$\Omega(s(n))$.

On the number of prime factors of values of the sum-of-proper-divisors function