Goldbach problem in polynomial values

dc.contributor.author Sankaranarayanan, A.
dc.date.accessioned 2022-03-27T04:08:52Z
dc.date.available 2022-03-27T04:08:52Z
dc.date.issued 1999-06-01
dc.description.abstract An even integer n ≥ 6 is called a Goldbach number if it is the sum of two odd primes. The Goldbach conjecture says that every even number n ≤ 6 is a Goldbach number. In this paper, we study the mean-square upper bound of the error term related to the Goldbach problem, in polynomial values over short intervals, uniformly with respect to the height of a polynomial of fixed degree. © 1999 Springer.
dc.identifier.citation Rendiconti del Circolo Matematico di Palermo. v.48(2)
dc.identifier.issn 0009725X
dc.identifier.uri 10.1007/BF02857301
dc.identifier.uri http://link.springer.com/10.1007/BF02857301
dc.identifier.uri https://dspace.uohyd.ac.in/handle/1/6542
dc.title Goldbach problem in polynomial values
dc.type Journal. Article
dspace.entity.type
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Plain Text
Description: