加载中…
Let be the von Mangoldt function and 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 a sufficiently large integer, let and let $M_{i}\left(N,k\right),, i=1,\dots,kJ_{v}\left(u\right)J_{v}\left(u\right)v$ and real argument . We prove that We also prove that with this technique the bound is optimal.

生成讲解博客的中文版本

生成AI智能校验的中文版本