[VA] Short & Sweet Math Challenge #24: "2019 Spring Special 5-tier"

[Bernd Grubert]

Hello Valentin,
here is my solution to Tier 2. It is 192 bytes long, due to the lack of prime number checking and the remainder function on the HP-15C.
I have done the test runs on the HP-15C emulator on a PC, since the processing time on my DM-15L is far too long...

Since the largest integer number the HP-15C can exactly represent is 9,999,999,999. , this implementation of the Miller-Rabin algorithm can check only number up to 99,999.
Due to memory limitations, on the real HP-15C and the DM 15L the longest sequence is 26 values.

For base 31 I got the sequence: 619, 18257, ...,(I stopped at 34139 after ~90 min., because I didn't want to wait any longer)

For base 7 I got the sequence: 4801, ...,(I stopped at 23451 after ~60 min.)

I have attached an HTML-documentation and a txt-file, that can be read into the emulator after changing the extension back to ".15c":
  Tier_2.htm (Size: 49.27 KB / Downloads: 2) and
  Tier_2.txt (Size: 6.5 KB / Downloads: 3) .

Best regards
Bernd