- #1
zetafunction
- 391
- 0
given the diophantine polynomial equation
[tex] f(x)=0mod(p) [/tex]
then is the number of solution approximately less than a given N approximately
[tex] \sum_{i\le N}e^{2i p\pi f(j)} [/tex]
the idea is that the sum takes its maximum value every time p divides f(j) for some integer 'j''
[tex] f(x)=0mod(p) [/tex]
then is the number of solution approximately less than a given N approximately
[tex] \sum_{i\le N}e^{2i p\pi f(j)} [/tex]
the idea is that the sum takes its maximum value every time p divides f(j) for some integer 'j''