Re: question on efficient but exhaustive 3 squares algorithm

[hermann@stamm-wilbrandt.de]

On 2023-11-17 22:54, American Citizen wrote:
> Can we derive an exhaustive threesquares(N) algorithm which does give
> all solutions for a specific N? and returns [] if
> no such representation occurs. This is the same as solving the
> [1,1,1,0,0,0] ternary quadratric form.
Hi Randall,

Bill did develop foursquares.gp based on this thread:
https://pari.math.u-bordeaux.fr/archives/pari-users-2310/msg00003.html

He always said that threesquares() only returns one solution.

What you want and is discussed in above posting is wolframscript
PowersRepresentations[n,k,p], see the posting for details.

Mathematica and wolframscript are free use for Raspberry Pi computers, 
and a Pi4B or Pi400 or new Pi5B is fast enough
for that to be useful.

Regards,

Hermann.