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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

For given positive integers $n$ and $a$, let $R(n;\,a)$ denote the number ofpositive integer solutions $(x,\,y)$ of the Diophantine equation $$ {a\overn}={1\over x}+{1\over y}. $$ Write $$ S(N;\,a)=\sum_{\substack{n\leq N(n,\,a)=1}}R(n;\,a). $$ Recently Jingjing Huang and R. C. Vaughan proved thatfor $4\leq N$ and $a\leq 2N$, there is an asymptotic formula $$S(N;\,a)={3\over \pi^2a}\prod_{p|a}{p-1\over p+1}\cdot N(\log^2N+c_1(a) \logN+c_0(a))+\Delta(N;\,a). $$ In this paper, we shall get a more explicitexpression with better error term for $c_0(a)$.

Mean Value from Representation of Rational Number as Sum of Two Egyptian Fractions