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

We define $\overline{\psi}$ to be the multiplicative arithemtic function thatsatisfies \[\overline{\psi}(p^{\alpha})=\begin{cases} p^{\alpha-1}(p+1), &\mbox{if } p\neq 2; \\ p^{\alpha-1}, & \mbox{if } p=2 \end{cases}\] for allprimes $p$ and positive integers $\alpha$. Let $\lambda(n)$ be the number ofiterations of the function $\overline{\psi}$ needed for $n$ to reach $2$. Itfollows from a theorem due to White that $\lambda$ is additive. FollowingShapiro's work on the iterated $\varphi$ function, we determine bounds for$\lambda$. We also use the function $\lambda$ to partition the set of positiveintegers into three sets $S_1,S_2,S_3$ and determine some properties of thesesets.

An Arithmetic Function Arising from the Dedekind $\psi$ Function