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

A consequence of Bertrand's postulate, proved by L. Greenfield and S.Greenfield in 1998, assures that the set of integers $\{1,2,\cdots, 2n\}$ canbe partitioned into pairs so that the sum of each pair is a prime number forany positive integer $n$. Cutting through it from the angle of Graph Theory,this paper provides new insights into the problem. We conjecture a strongerstatement that the set of integers $\{1,2,\cdots, 2n\}$ can be rearranged intoa cycle so that the sum of any two adjacent integers is a prime number. Ourmain result is that this conjecture is true for infinitely many cases.

From a Consequence of Bertrand's Postulate to Hamilton Cycles