Semiprime: Difference between revisions

m
→‎version 2: added/changed comments and whitespace, changed indentations.
mNo edit summary
m (→‎version 2: added/changed comments and whitespace, changed indentations.)
Line 1,245:
 
===version 2===
The method used is to examine numbersintegers, skipping primes.
 
If it's composite (the 1<sup>st</sup> factor is prime), then check if the 2<sup>nd</sup> factor is prime. &nbsp; If so, the number is a &nbsp; ''semiprime''.
 
The &nbsp; '''isPrime''' &nbsp; function could be optimized by utilizing an integer square root function instead of testing if &nbsp; '''j*j>x''' &nbsp; for every divisor.
<lang rexx>/*REXX program determines if any numberinteger (or a range of integers) is/are semiprime. */
parse arg bot top . /*obtain optional numbersarguments from the C.L.CL*/
if bot=='' | bot=="," then bot=random() /*None given? User wants us to guess.*/
if top=='' | top=="," then top=bot /*maybe define a range of numbers. */
w=max(length(bot), length(top)) /*obtain the maximum width of numbers. */
numeric digits max(9, w) /*ensure there're enough decimal digits*/
do n=bot to top /*show results for a range of numbers. */
if isSemiPrime(n) then say right(n, w) " is semiprime."
else say right(n, w) " isn't semiprime."
end /*n*/
exit /*stick a fork in it, we're all done. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
/*────────────────────────────────────────────────────────────────────────────*/
isPrime: procedure; parse arg x; if x<2 then return 0 /*number too low?*/
if wordpos(x, '2 3 5 7 11 13 17 19 23')\==0 then return 1 /*it's low prime.*/
if x//2==0 then return 0; if x//3==0 then return 0 /*÷ by 2; ÷ by 3?*/
do j=5 by 6 until j*j>x; if x//j==0 then return 0 /*not a prime. */
if x//(j+2)==0 then return 0 /* " " " */
end /*j*/
return 1 /*indicate that X is a prime number. */
/*──────────────────────────────────────────────────────────────────────────────────────*/
/*────────────────────────────────────────────────────────────────────────────*/
isSemiPrime: procedure; parse arg x; if \datatype(x,'W') | if x<4 then return 0
 
x=x/1
do i=2 for 2; if x//i==0 then if isPrime(x%i) then return 1
else return 0
end /*i*/
/* ___ */
do j=5 by 6; if j*j>x then return 0 /* > √ x ? ?*/
do k=j by 2 for 2; if x//k==0 then if isPrime(x%k) then return 1
else return 0
end /*k*/ /* [↑] see if 2nd factor is prime or ¬*/
end /*j*/ /* [↑] never ÷ by J ifis Jnever isa mult.multiple of 3three.*/</lang>
'''output''' &nbsp; when using the input isof: &nbsp; <tt> -1 &nbsp; 106 </tt>
<pre style="height:44ex">
-1 isn't semiprime.
Line 1,392:
106 is semiprime.
</pre>
'''output''' &nbsp; when using the input isof: &nbsp; <tt> 99888111555 &nbsp; 99888111600 </tt>
<pre style="height:44ex">
99888111555 isn't semiprime.