Initial data commit
This commit is contained in:
Ingy döt Net
parent
72d218235f
commit
f23f22d71c
199087 changed files with 3378941 additions and 0 deletions
56
Task/Semiprime/REXX/semiprime-1.rexx
Normal file
56
Task/Semiprime/REXX/semiprime-1.rexx
Normal file
|
|
@ -0,0 +1,56 @@
|
|||
/* REXX ---------------------------------------------------------------
|
||||
* 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
|
||||
* 21.02.2014 WP Make sure that factr is not called illegally
|
||||
*--------------------------------------------------------------------*/
|
||||
Call test 4
|
||||
Call test 9
|
||||
Call test 10
|
||||
Call test 12
|
||||
Call test 1679
|
||||
Exit
|
||||
|
||||
test:
|
||||
Parse Arg z
|
||||
If is_semiprime(z) Then Say z 'is semiprime' fl
|
||||
Else Say z 'is NOT semiprime' fl
|
||||
Return
|
||||
|
||||
is_semiprime:
|
||||
Parse Arg z
|
||||
If z<1 | datatype(z,'W')=0 Then Do
|
||||
Say 'Argument ('z') must be a natural number (1, 2, 3, ...)'
|
||||
fl=''
|
||||
End
|
||||
Else
|
||||
fl=factr(z)
|
||||
Return words(fl)=2
|
||||
|
||||
/*----------------------------------FACTR subroutine-----------------*/
|
||||
factr: procedure; parse arg x 1 z,list /*sets X&Z to arg1, LIST=''. */
|
||||
if x==1 then return '' /*handle the special case of X=1.*/
|
||||
j=2; call .factr /*factor for the only even prime.*/
|
||||
j=3; call .factr /*factor for the 1st odd prime.*/
|
||||
j=5; call .factr /*factor for the 2nd odd prime.*/
|
||||
j=7; call .factr /*factor for the 3rd odd prime.*/
|
||||
j=11; call .factr /*factor for the 4th odd prime.*/
|
||||
j=13; call .factr /*factor for the 5th odd prime.*/
|
||||
j=17; call .factr /*factor for the 6th odd prime.*/
|
||||
/* [?] could be optimized more.*/
|
||||
/* [?] J in loop starts at 17+2*/
|
||||
do y=0 by 2; j=j+2+y//4 /*insure J isn't divisible by 3. */
|
||||
if right(j,1)==5 then iterate /*fast check for divisible by 5. */
|
||||
if j*j>z then leave /*are we higher than the v of Z ?*/
|
||||
if j>Z then leave /*are we higher than value of Z ?*/
|
||||
call .factr /*invoke .FACTR for some factors.*/
|
||||
end /*y*/ /* [?] only tests up to the v X.*/
|
||||
/* [?] LIST has a leading blank.*/
|
||||
if z==1 then return list /*if residual=unity, don't append*/
|
||||
return list z /*return list, append residual. */
|
||||
/*-------------------------------.FACTR internal subroutine----------*/
|
||||
.factr: do while z//j==0 /*keep dividing until we can't. */
|
||||
list=list j /*add number to the list (J). */
|
||||
z=z%j /*% (percent) is integer divide.*/
|
||||
end /*while z··· */ /* // ?---remainder integer ÷.*/
|
||||
return /*finished, now return to invoker*/
|
||||
35
Task/Semiprime/REXX/semiprime-2.rexx
Normal file
35
Task/Semiprime/REXX/semiprime-2.rexx
Normal file
|
|
@ -0,0 +1,35 @@
|
|||
/*REXX program determines if any integer (or a range of integers) is/are semiprime. */
|
||||
parse arg bot top . /*obtain optional arguments from the 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. */
|
||||
tell= top=>0 | top==bot /*should results be shown to the term? */
|
||||
w=max(length(bot), length(top)) + 5 /*obtain the maximum width of numbers. */
|
||||
numeric digits max(9, w) /*ensure there're enough decimal digits*/
|
||||
#=0 /*initialize number of semiprimes found*/
|
||||
do n=bot to abs(top) /*show results for a range of numbers. */
|
||||
?=isSemiPrime(n); #=#+? /*Is N a semiprime?; Maybe bump counter*/
|
||||
if tell then say right(n,w) right(word("isn't" 'is', ?+1), 6) 'semiprime.'
|
||||
end /*n*/
|
||||
say
|
||||
if bot\==top then say 'found ' # " semiprimes."
|
||||
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 x<4 then return 0
|
||||
|
||||
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*/ /* [↑] J is never a multiple of three.*/
|
||||
41
Task/Semiprime/REXX/semiprime-3.rexx
Normal file
41
Task/Semiprime/REXX/semiprime-3.rexx
Normal file
|
|
@ -0,0 +1,41 @@
|
|||
/*REXX program determines if any integer (or a range of integers) is/are semiprime. */
|
||||
parse arg bot top . /*obtain optional arguments from the 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. */
|
||||
tell= bot=>0 & top=>0 /*should results be shown to the term? */
|
||||
w=max(length(bot), length(top)) /*obtain the maximum width of numbers. */
|
||||
!.=; !.2=1; !.3=1; !.5=1; !.7=1; !.11=1; !.13=1; !.17=1; !.19=1; !.23=1; !.29=1; !.31=1
|
||||
numeric digits max(9, w) /*ensure there're enough decimal digits*/
|
||||
#=0 /*initialize number of semiprimes found*/
|
||||
do n=abs(bot) to abs(top) /*show results for a range of numbers. */
|
||||
?=isSemiPrime(n); #=#+? /*Is N a semiprime?; Maybe bump counter*/
|
||||
if tell then say right(n,w) right(word("isn't" 'is', ?+1), 6) 'semiprime.'
|
||||
end /*n*/
|
||||
say
|
||||
if bot\==top then say 'found ' # " semiprimes."
|
||||
exit /*stick a fork in it, we're all done. */
|
||||
/*──────────────────────────────────────────────────────────────────────────────────────*/
|
||||
isPrime: procedure expose !.; parse arg x; if x<2 then return 0 /*number too low?*/
|
||||
if !.x==1 then return 1 /*a known prime. */
|
||||
if x// 2==0 then return 0; if x//3==0 then return 0 /*÷ by 2;÷by 3?*/
|
||||
parse var x '' -1 _; if _==5 then return 0 /*last digit a 5?*/
|
||||
if x// 7==0 then return 0; if x//11==0 then return 0 /*÷ by 7;÷by 11?*/
|
||||
if x//13==0 then return 0; if x//17==0 then return 0 /*÷ by 13;÷by 17?*/
|
||||
if x//19==0 then return 0; if x//23==0 then return 0 /*÷ by 19;÷by 23?*/
|
||||
do j=29 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*/
|
||||
!.x=1; return 1 /*indicate that X is a prime number. */
|
||||
/*──────────────────────────────────────────────────────────────────────────────────────*/
|
||||
isSemiPrime: procedure expose !.; parse arg x; if x<4 then return 0
|
||||
|
||||
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 until j*j>x /* > √ 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*/ /* [↑] J is never a multiple of three.*/
|
||||
return 0
|
||||
Loading…
Add table
Add a link
Reference in a new issue