Post Reply 
Most advantageous program written for 41/42?
03-12-2021, 08:31 AM (This post was last modified: 03-12-2021 08:41 AM by EdS2.)
Post: #10
RE: Most advantageous program written for 41/42?
(03-11-2021 06:22 AM)Gerald H Wrote:  Shanks' square form factorization generally faster than Pollard rho on 42S.

For info on SQFOF see

See also Shanks' own notes on SQUFOF, as transcribed here, and particularly this bit about the HP-65:
Quote:Concerning Brillhart’s second question, I felt that the answer would be, “no”—N₀ does not lead to absolute failure, but to prove this I had only a hand-held HP-65 with its very small memory (100 steps in the program). Obviously, one cannot put the huge BRIMOR on such a machine. But one can put on the simple algorithm...
... factor the 19-digit N₀ as
(22) N₀ = 139001459 · 8294312261
even though the HP-65 only computes with 10-digit numbers.

Attached File(s) Thumbnail(s)
Find all posts by this user
Quote this message in a reply
Post Reply 

Messages In This Thread
RE: Most advantageous program written for 41/42? - EdS2 - 03-12-2021 08:31 AM

User(s) browsing this thread: 1 Guest(s)