Odd squarefree semiprimes: Difference between revisions

Content added Content deleted

Inline

@@ Line 28: / Line 28: @@
     # show odd square free semi-primes up to 1000 #
     INT max number = 1000;
-    []INT prime    = prime list( 100 * max number ); # (very) rough approximation of where the last prime under 1001 is #
+    INT max prime  = 1 + ( max number OVER 3 ); # the smallest odd prime is 3, so this shuld be enough primes #
+    []INT prime    = prime list( max prime );
     [ 1 : max number ]BOOL numbers; FOR i TO max number DO numbers[ i ] := FALSE OD;
-    FOR i FROM 2 TO max number - 1 DO
+    FOR i FROM 2 TO UPB prime - 1 DO
-        FOR j FROM i + 1 TO max number
+        FOR j FROM i + 1 TO UPB prime
         WHILE INT pq = prime[ i ] * prime[ j ];
               pq < max number