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 Tools annual

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 Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Referring to a theorem of A. E. Ingham, that for all $N\geq N_0$ (an absolute constant), the inequality $N^3\leq p\leq(N+1)^3$ is solvable in a prime $p$, we point out in this paper that it is implicit that he has actually proved that $\pi(x+h)-\pi(x) \sim h(\log x)^{-1}$ where $h=x^c$ and $c (&gt;\frac{5}{8})$ is any constant. Further, we point out that even this stronger form can be proved without using the functional equation of $\zeta(s)$.

A remark on a theorem of A. E. Ingham.