#hp65 — Public Fediverse posts
Live and recent posts from across the Fediverse tagged #hp65, aggregated by home.social.
-
From the 70's, Shanks' SQUFOF algorithm for prime factorising using square forms, with a mention of the HP-65...
"""
...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.
"""