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 $q\ge 3$ be a non-exceptional modulus $q\ge3$, and let $a$ be a positiveinteger coprime with $q$. For any $\epsilon>0$, there exists $\alpha>0$(computable), such that for all $x\ge \alpha (\log q)^2$, the interval $\left[e^x,e^{x+\epsilon }\right]$ contains a prime $p$ in the arithmetic progression$a \bmod q$. This gives the bound for the least prime in this arithmeticprogression: $P(a,q) \le e^{\alpha (\log q)^2}$. For instance for all $q\ge10^{30}$, $P(a,q) \le e^{4.401(\log q)^2}$. Finally, we apply this result toestablish that every integer larger than $e^{71\,000}$ is a sum of seven cubes.

Short effective intervals containing primes in arithmetic progressions and the seven cubes problem