Premium
On the sum of two primes and k powers of two
Author(s) -
Languasco A.,
Pintz J.,
Zaccagnini A.
Publication year - 2007
Publication title -
bulletin of the london mathematical society
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 2.396
H-Index - 48
eISSN - 1469-2120
pISSN - 0024-6093
DOI - 10.1112/blms/bdm062
Subject(s) - mathematics , integer (computer science) , combinatorics , asymptotic formula , discrete mathematics , computer science , programming language
Let X be a large integer. We prove that, for any fixed positive integer k , a suitable asymptotic formula for the number of representations of an even integer N ε [1,X] as the sum of two primes and k powers of 2 holds with at mostO k ( X 3 / 5 ( log X )10 ) exceptions.