Semiprime: Difference between revisions
Content added Content deleted
m (→version 2: added/changed comments, optimized a DO loop. -- ~~~~) |
Walterpachl (talk | contribs) (→version 1: better mention of original algorithm courtesy GS) |
||
| Line 110: | Line 110: | ||
===version 1=== |
===version 1=== |
||
<lang rexx>/* REXX --------------------------------------------------------------- |
<lang rexx>/* REXX --------------------------------------------------------------- |
||
* 20.02.2014 Walter Pachl relying on prime decomposition |
* 20.02.2014 Walter Pachl relying on 'prime decomposition' |
||
* 21.02.2014 WP Clarification: I copied the algorithm created by |
|||
* Gerard Schildberger under the task referred to above |
|||
*--------------------------------------------------------------------*/ |
*--------------------------------------------------------------------*/ |
||
Call test 4 |
Call test 4 |
||
| Line 121: | Line 123: | ||
test: |
test: |
||
Parse Arg z |
Parse Arg z |
||
If |
If is_semiprime(z) Then Say z 'is semiprime' fl |
||
Else Say z 'is NOT semiprime' fl |
Else Say z 'is NOT semiprime' fl |
||
Return |
Return |
||
is_semiprime: |
|||
isprime: |
|||
Parse Arg z |
Parse Arg z |
||
fl=factr(z) |
fl=factr(z) |
||