Recent content by quila

Homework Statement Let P be a finite projective plane so that all lines in P have the same number of points lying on them; call this number n+1, with n greater than or equal to 2. Show the following: a) each point in P has n+1 lines passing through it. b)the total number of points in P is...

what if n is large? say n>100

how does one go about finding integer solutions for an equation such as this? Is it easier to merely find how many solutions? y^2 = x^3 + n, n is some integer.

hmmm...I have no clue how you did that. Could you give me a hint or something, i.e. the name of the procedure?

k, thanks

So if it ends up equaling 1 it will be solvable, and if it ends up equaling -1 it won't be solvable? If it is solvable, how do you solve it?

Can some one tell me how to figure out if this is solvable or not? For the Prime number p=68659, 19=x^2 mod p. Why?