PARI code analyzing whether given integer is presentable as sum of two integer squares

Alexander Povolotsky apovolot at gmail.com
Thu Nov 22 02:03:44 CET 2007


Hi,

Could anyone write/post PARI code (function) analyzing whether given
integer is presentable as sum of two integer squares (finding all the
combinations if more than one exist)?
I didn't come across of such code currently posted in any OEIS related
sequence ...

Thanks,
Alex





More information about the SeqFan mailing list