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

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

'. Let j(n) denote the smallest positive integer m such that every sequence of m consecutive integers contains an integer prime to n. Let P n be the product of the first n primes and define h(n) = j(P n ). Presently, h(n) is only known for n ≤ 24. In this paper, we describe an algorithm that enabled the calculation of h(n) for n < 50.

Computation of Jacobsthal’s function $h(n)$ for $n<50$.