RPL second impressions (HP 28)

[Thomas Klemm]

(06-30-2018 03:32 PM)Gerson W. Barbosa Wrote:  Yes, for n>3 (if I’ve entered it right). Anyway, 172 seconds (down from 201 seconds).

I've written a new article: Miller-Rabin Primality Test for the HP-48

(06-30-2018 10:20 AM)RMollov Wrote:  I followed advice I found somewhere to create little routines with known input and output, test them and latter combine them to make complex program.

This was used to create the programs:

• PLUS
• TIMES
• POWER
• COMPOSITE?
• PRIME?
  

I recommend to create them in a separate directory.
They aren't optimised for speed but I still assume that it's much faster than the naïve approach.

I'd be interested to know how long it takes on a real HP-28 to verify that 177777773 or 999999999989 are primes.

Cheers
Thomas

PS: For this program n must be bigger than 2.