Let be the series(adsbygoogle = window.adsbygoogle || []).push({});

[tex] \sum_{p<N}e^{2\pi p ix}=f(x) [/tex] where the sum is intended to be

over all primes less or equal than a given N.

My question is if there are approximate methods to evaluate this series for N big , since for a big prime the exponential sum is very oscillating would it be an 'intelligent' form to evaluate it for big N?, of course we know the trivial bound [tex] f(x)<\pi(N) [/tex] however i think this is rather useless.

**Physics Forums | Science Articles, Homework Help, Discussion**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Approximate evaluation of this series (exponential sum)

**Physics Forums | Science Articles, Homework Help, Discussion**