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

For fixed positive integers $n$, we study the solution of the equation $n = k+ p_k$, where $p_k$ denotes the $k$th prime number, by means of the iterativemethod \[ k_{j+1} = \pi(n-k_j), \qquad k_0 = \pi(n), \] which converges to thesolution of the equation, if it exists. We also analyze the equation $n = ak +bp_k$ for fixed integer values $a \ne 0$ and $b>0$, and its solution by meansof a corresponding iterative method. The case $a>0$ is somewhat similar to thecase $a=b=1$, while for $a<0$ the convergence and usefulness of the method areless satisfactory. The paper also includes a study of the dynamics of theiterative methods.

On the Solution of the Equation $n = ak + bp_k$ by Means of an Iterative Method