The algorithm for solving the big integer Lagrange Four Square Sum problem implemented in Go.
The algorithm is suitable for find the solution for very large integers, like 1000 bits, 2000 bits, or more.
-
Notifications
You must be signed in to change notification settings - Fork 0
Blazingly fast Lagrange Four Square Sum algorithm.
License
txaty/lfs
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Blazingly fast Lagrange Four Square Sum algorithm.
Topics
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published