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 - The Fusion of Science and Community**

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)

Loading...

Similar Threads - Approximate evaluation series | Date |
---|---|

Approximate a spectrum from a series of measurements | Feb 11, 2016 |

Irreducibility of polynomial (need proof evaluation) | May 21, 2015 |

Approximate diagonalisation of (3,3) hermitian matrix | Feb 3, 2014 |

How to approximate sqrt(A+B) | Feb 1, 2014 |

SVD Low-Rank Approximation Algorithm | Dec 10, 2013 |

**Physics Forums - The Fusion of Science and Community**