Solutions of a diophantine equation

  • #1
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''
 

Answers and Replies

  • #2
Petek
Gold Member
364
9
I replied yesterday (March 26), but the reply was lost with the server problems. I'll try again:

Your summation expression appears to have a typo. If n is any integer, then

[tex]e^{2i p\pi n} = 1[/tex]

so the expression always sums to N. Perhaps you meant to divide by p in the exponent instead of multiplying by p. Questions of this sort are discussed in the first few sections of Number Theory by Borevich and Shafarevich.

Additional comments:

1. You might want to test your formula with [itex]f(x) = x^p - x[/itex], since all natural numbers are solutions.

2. In general, your sum will be a complex number. In what sense do you want to consider a complex number to approximate the number of solutions?

Petek
 

Related Threads on Solutions of a diophantine equation

Replies
3
Views
4K
Replies
2
Views
3K
  • Last Post
Replies
1
Views
3K
  • Last Post
Replies
2
Views
4K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
8
Views
3K
  • Last Post
Replies
2
Views
3K
  • Last Post
Replies
1
Views
2K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
6
Views
2K
Top