解析数论中的若干问题

Let E(x) denote the number of even numbers not exceeding x which cannot be written as a sum of two odd primes. We proved that E（x）《 x0.914.For almost Goldbach problem, we proved every.sufficiently large even integer can be written as a sum of teo primes and 1906 powers of 2. For Diophantine equation a1p1+ a2p2+ a3p3 =0, we look for the prime solutions that satisfy 0<|pi|< max{|a1|，|a2|，|a3|}c, in which c is called Baker’s constant. We proved that c can be choosen as 38.

本项目拟通过对指数和估计的改进以及L—函数的零点分布的研究，结合圆法和筛法等解析壑械钠渌椒ɡ囱芯克厥⒋厥⒏绲掳秃帐姆植家约盎治侍夂推渌恍┘有头匠痰奈侍猓纾合咝运乇涫匠獭⒛飧绲掳秃瘴侍獾取Ｕ庑┪侍馐墙馕鍪鄣拇逞芯慷韵螅哉庑┪侍獾娜魏胃慕兄匾睦砺垡庖澹越馕鍪鄣姆⒄褂兄匾饔谩