scramble prime challenge

[Allen]

Ran the actual numbers in python, then made a quick-n-dirty set check based on the MOD function. 61 bytes on free42 (I think it can be cut down to 57-59 without too much effort..)

The function allows the checking of several primes in parallel:

Code:


143313465 [3, 5, 31, 311, 991]
90201098 [2, 13, 71, 131, 373]
47258521 [17, 73, 113, 337]
51869279 [7, 11, 733, 919]
56422669 [37, 79, 97, 199]

Returns 0 if it is a "scramble prime" otherwise some other number.

Code:


00 { 61-Byte Prgm }
01 STO 01
02 143313465
03 RCL 01
04 MOD
05 90201098
06 RCL 01
07 MOD
08 ×
09 47258521
10 RCL 01
11 MOD
12 ×
13 51869279
14 RCL 01
15 MOD
16 ×
17 56422669
18 RCL 01
19 MOD
20 ×
21 .END.