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
Add a method to find a vector x such that Q(x) = C, where Q is a quadratic form and C is a constant. #19533
Comments
Branch: u/tgaona/ticket/19533 |
New commits:
|
Commit: |
comment:3
One quick comment (I have not fully checked the patch): it would be useful to change the function to
such that |
comment:4
Why divide by You should limit the length of lines to 72 characters if possible,
|
comment:5
Another minor thing: I would change the error message to raise ArithmeticError("no solution found (local obstruction at {})".format(x)) |
comment:6
Replace
by
|
Branch pushed to git repo; I updated commit sha1. New commits:
|
Changed branch from u/tgaona/ticket/19533 to u/jdemeyer/ticket/19533 |
comment:10
I have made a lot of small changes. I also added a few more examples. If you agree, you can set this to positive_review. New commits:
|
Reviewer: Jeroen Demeyer |
Changed branch from u/jdemeyer/ticket/19533 to |
This algorithm can be implemented using PARI's qfsolve(). Will be used as a component for the method implemented in Ticket [ticket:19112]
CC: @annahaensch
Component: quadratic forms
Author: Tyler Gaona
Branch/Commit:
c3ef1ed
Reviewer: Jeroen Demeyer
Issue created by migration from https://trac.sagemath.org/ticket/19533
The text was updated successfully, but these errors were encountered: