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 present all solutions to the equation Σ p|N 1/p + 1/N = 1 with at most eight primes, improve the bound on the nonsolvability of the Erdos-Moser equation Σ m-1 j=1 j n = m n , and discuss the computational search techniques used to generate examples of perfectly weighted graphs.

On the equation $\sum_{p|N}\frac1p+\frac1N = 1$, pseudoperfect numbers, and perfectly weighted graphs