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

Given a finite set of primes $S$ and a $m$-tuple $(a_1,\dots,a_m)$ ofpositive, distinct integers we call the $m$-tuple $S$-Diophantine, if for each$1\leq i < j\leq m$ the quantity $a_ia_j+1$ has prime divisors coming only fromthe set $S$. For a given set $S$ we give a practical algorithm to find all$S$-Diophantine quadruples, provided that $|S|=3$.

Finding all $S$-Diophantine quadruples for a fixed set of primes $S$