View Single Post
Old 2018-09-09, 18:43   #5
alpertron's Avatar
Aug 2002
Buenos Aires, Argentina

52816 Posts

Now the calculation of sum of squares uses GCD of Gaussian integers (for two squares) and GCD of quaternions (for four squares).

The GCD takes about 1 second for numbers of 10000 digits (I tested that with the smallest gigantic prime, which is 109999 + 33603). Most of the time is used for a modular power.

With the previous version, computing the sum of four squares would have taken about one hour.

I will continue doing more tests, and if everything works OK, I will move the new Web application to the "standard" URL.
alpertron is offline   Reply With Quote