Skip to content
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 comments on dixon.py #1

Open
imavijit opened this issue Mar 26, 2020 · 1 comment
Open

Add comments on dixon.py #1

imavijit opened this issue Mar 26, 2020 · 1 comment

Comments

@imavijit
Copy link

Please add comments on dixon.py.It will be easier to understand

@AReallyGoodName
Copy link

Note that dixons.py here is not actually Dixons method at all. It's a brute force match of congruence of squares. It squares the numbers and compares those to squares in the factor base. If they equal it outputs the result. This isn't Dixons method. It's a brute force search for equivalent squares.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants