-
Notifications
You must be signed in to change notification settings - Fork 9
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
exercise-66 #1
Comments
Though I managed to stitch a thing. F = FiniteField(5)
P = ProjectiveSpace(2, F)
for p in P:
if p[1]^2 * p[2] == p[0]^3 + p[0] * p[2]^2 + p[2]^3 :
print(p) |
Greetings @skaunov,
Thank you for the suggestion, firstly I solved it by iterating over the affine points with
However, I liked your suggestion of using Anyways, I wrote the following: F5 = GF(5)
F5P2 = ProjectiveSpace(F5, 2)
points = [(x, y, z) for (x, y, z) in F5P2 if y^2 * z == x^3 + x * z^2 + z^3] I will be adding it to the solution 👌🏻 |
Hi, @erhant ! Please tell me if such issues is welcome, since it's just a way of discussions for me. Also I'm not a Pythonist, so I can't suggest a nice commit in case...
So. I feel like https://github.com/erhant/moonmath/tree/master/elliptic-curves#exercise-66 isn't done in the spirit of the exercise. To me it looks like the idea was take all projective plane points and filter them getting the set of those which are
in
the curve.It's still a question for me what's the best way not to double check projective points... Is there an iterator over them in Sage? Or just find out a fine traversing algorithm, which seems not a huge headache in a small field.
The text was updated successfully, but these errors were encountered: