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

Let $\Lambda$ be the von Mangoldt function and $r_{Q}\left(n\right)=\sum_{m_{1}+m_{2}^{2}+m_{3}^{2}=n}\Lambda\left(m_{1}\right)$ be the counting function for the numbers that can be written as sum of a prime and two squares (that we will call Linnik numbers, for brevity). Let $N$ a sufficiently large integer, let $k>3/2$ and let $M_{i}\left(N,k\right),\, i=1,\dots,k$ suitable parameters depending on $J_{v}\left(u\right)$, where $J_{v}\left(u\right)$ denotes the Bessel function of complex order $v$ and real argument $u$. We prove that $$ \sum_{n\leq N}r_{Q}\left(n\right)\frac{\left(N-n\right)^{k}}{\Gamma\left(k+1\right)}=M_{1}\left(N,k\right)+M_{2}\left(N,k\right)+M_{3}\left(N,k\right)+M_{4}\left(N,k\right)+O\left(N^{k+1}\right).$$ We also prove that with this technique the bound $k>3/2$ is optimal.

On the Cesàro average of the “Linnik numbers”