GaussInt factoring about number-theory-python HOT 1 OPEN

$ time ./gaussian 509435952285839914555051023580843714132648382024111473186660296521821206469746700620316443478873837606252372049619334517 1
2<p>Factors of 509435 952285 839914 555051 023580 843714 132648 382024 111473 186660 296521 821206 469746 700620 316443 478873 837606 252372 049619 334517 (120 digits) + 0 i<ul><li>664725 951658 524848 356077 798734 408273 267435 380913 396313 107174 (60 digits) + 259952 613907 820517 149425 140676 632621 008474 102347 669603 089079 (60 digits) i</li><li>664725 951658 524848 356077 798734 408273 267435 380913 396313 107174 (60 digits) - 259952 613907 820517 149425 140676 632621 008474 102347 669603 089079 (60 digits) i</li></ul><p>Time elapsed: </p><p>Written by Dario Alpern. Last updated on 4 December 2022.</p>

real	0m0.014s
user	0m0.011s
sys	0m0.003s
$

$ ./square_sum_prod 1105 py; echo
2,1,3,2,4,1
$

$ python -q
>>> from RSA_numbers_factored import RSA, square_sums
>>> R = RSA()
>>> R.square_sum_prod(1105)
[2, 1, 3, 2, 4, 1]
>>> square_sums(R.square_sum_prod(1105))
[[4, 33], [9, 32], [12, 31], [23, 24]]
>>> square_sums(R.square_sum_prod(1105), revt=True, revl=True)
[[33, 4], [32, 9], [31, 12], [24, 23]]
>>> 
>>> l,n,p,q = R.get(240)
>>> R.square_sum_prod(p)
[664725951658524848356077798734408273267435380913396313107174, 259952613907820517149425140676632621008474102347669603089079]
>>>