Pierpont primes: Difference between revisions

Content deleted Content added

Inline

@@ Line 1,728: / Line 1,728: @@
       def long x = 1, j
       while np(1)<=NPP or np(2)<=NPP
-          x++ : if x mod 100&=0& then print  np(), x: refresh
+          x++
           j = @is_pierpont(x)
           if j>0 Else Continue