Data update

Task/Prime-decomposition/EasyLang/prime-decomposition.easy

@@ -1,5 +1,4 @@
-proc decompose num . primes[] .
-   primes[] = [ ]
+func[] decompose num .
    t = 2
    while t * t <= num
       if num mod t = 0
@@ -10,6 +9,8 @@ proc decompose num . primes[] .
       .
    .
    primes[] &= num
+   return primes[]
+.
+for v in [ 27 1232125 9007199254740991 ]
+   print decompose v
 .
-decompose 9007199254740991 r[]
-print r[]

Task/Prime-decomposition/REXX/prime-decomposition-4.rexx

@@ -0,0 +1,104 @@
+/*REXX pgm does prime decomposition of a range of positive integers (with a prime count)*/
+call time('r')
+Numeric Digits 1000                   /*handle thousand digits For the powers*/
+Parse Arg  bot  top  step   base  add /*get optional arguments from the C.L. */
+If bot='qq' Then Do
+  Say 'rexx pfoo bot  top  step   base  add'
+  Exit
+  End
+If bot=='' Then                       /* no arguments given                  */
+  Parse Value 1 100 With bot top      /* set default range                  .*/
+If top=='' Then top=bot               /* process one number                  */
+If step=='' Then step=1               /* step=2 to process only odd numbers  */
+If add =='' Then add=-1               /* for Mersenne tests                  */
+tell=top>0                            /*If TOP is negative, suppress displays*/
+top=abs(top)
+w=length(top)                         /*get maximum width For aligned display*/
+If base\=='' Then
+  w=length(base**top)                 /*will be testing powers of two laterqq */
+tag.=left('', 7)                      /*some literals:  pad;  prime (or not).*/
+tag.0='{unity}'
+tag.1='[prime]'
+Numeric Digits max(9,w+1)             /*maybe increase the digits precision. */
+np=0                                  /*np:    is the number of primes found.*/
+Do n=bot To top by step               /*process a single number or a range.  */
+  qq=n
+  If base\=='' Then                   /*should we perform a 'Mersenne' testqq */
+    qq=base**n+add
+  f=factors(qq)                       /* number of prime factors             */
+  If f=1 Then                         /* If the number is prime              */
+    np=np+1                           /* Then bump prime counter             */
+  If tell Then do
+     pf = ''
+     do i = 1 to f
+        pf = pf glob.factor.i
+     end
+    Say right(qq,w) right('('f')',9) 'prime factors: ' tag.f pf
+  end
+  End   /*n*/
+Say ''
+ps='prime'
+If f>1 Then ps=ps's'                  /*setup For proper English in sentence.*/
+Say right(np, w+9+1) ps 'found.'      /*display the number of primes found.  */
+say format(time('e'),,3) 'seconds'
+Exit                                  /*stick a fork in it,  we're all done. */
+
+Factors:
+/* Prime factors of an integer */
+procedure expose glob.
+arg x
+/* Validity */
+if \ Whole(x) then
+   return 'X'
+if x < 1 then
+   return 'X'
+/* Fast values */
+if x = 1 then do
+   glob.factor.0 = 0
+   return 0
+end
+if x < 4 then do
+   glob.factor.1 = x; glob.factor.0 = 1
+   return 1
+end
+if Prime(x) then do
+   glob.factor.1 = x; glob.factor.0 = 1
+   return 1
+end
+/* Check low factors */
+n = 0
+pr = '2 3 5 7 11 13 17 19 23'
+do i = 1 to Words(pr)
+   p = Word(pr,i)
+   do while x//p = 0
+      n = n+1; glob.factor.n = p
+      x = x%p
+   end
+end
+/* Check higher factors */
+do j = 29 by 6 while j*j <= x
+   p = Right(j,1)
+   if p <> 5 then do
+      do while x//j = 0
+         n = n+1; glob.factor.n = j
+         x = x%j
+      end
+   end
+   if p = 3 then
+      iterate
+   y = j+2
+   do while x//y = 0
+      n = n+1; glob.factor.n = y
+      x = x%y
+   end
+end
+/* Last factor */
+if x > 1 then  do
+   n = n+1; glob.factor.n = x
+end
+glob.factor.0 = n
+/* Return number of factors */
+return n
+
+include Functions
+include Numbers