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  Diophantine   m ‐ tuple  is a set  A  of  m  positive integers such that  ab +1 is a perfect square for every pair  a , b  of distinct elements of  A . We derive an asymptotic formula for the number of Diophantine quadruples whose elements are bounded by  x . In doing so, we extend two existing tools in ways that might be of independent interest. The Erdős–Turán inequality bounds the discrepancy between the number of elements of a sequence that lie in a particular interval modulo 1 and the expected number; we establish a version of this inequality where the interval is allowed to vary. We also adapt an argument of Hooley on the equidistribution of solutions of polynomial congruences to handle reducible quadratic polynomials.

ERDŐS–TURÁN WITH A MOVING TARGET, EQUIDISTRIBUTION OF ROOTS OF REDUCIBLE QUADRATICS, AND DIOPHANTINE QUADRUPLES