加载中…
Let be the set of odd integers that are sums of two coprime squares. We prove that the trigonometric polynomial satisfies for any and when and . We use this estimate together with a variant of the circle method influenced by Green and Tao’s Transference Principle to obtain the number of representations of a large enough odd integer as a sum , where while (resp. ) belongs to a general subset (resp. ) of of relative positive density. We further show that the above bound is effective when .

生成讲解博客的中文版本

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