Anonymous user
Pierpont primes: Difference between revisions
m
→{{header|REXX}}: added a programming note to the REXX section header.
(→{{header|REXX}}: added the REXX computer programming language for this task.) |
m (→{{header|REXX}}: added a programming note to the REXX section header.) |
||
Line 89:
=={{header|REXX}}==
The REXX language has a "big num" capability to handle almost any amount of decimal digits, but
<br>it lacks a robust '''isPrime''' function. Without that, verifying very large primes is problematic.
<lang rexx>/*REXX program finds and displays Pierpont primes of the first and second kinds. */
parse arg n . /*obtain optional argument from the CL.*/
| |||