Short intervals asymptotic formulae for binary problems with prime powers

Abstract: We prove results about the asymptotic formulae in short intervals for the average number of representations of integers of the forms

n = p_{1}^{e l l_{1}} + p_{2}^{e l l_{2}}

, with

e l l_{1}, e l l_{2} i n 2, 3

,

e l l_{1} + e l l_{2} l e 5

are fixed integers, and

n = p^{e l l_{1}} + m^{e l l_{2}}

, with

e l l_{1} = 2

and

2 l e e l l_{2} l e 11

or

e l l_{1} = 3

and

e l l_{2} = 2

are fixed integers,

p, p_{1}, p_{2}

are prime numbers and

m

is an integer.

Recommendations

Cites work

Cited in

(7)

This page was built for publication: Short intervals asymptotic formulae for binary problems with prime powers