Truncatable primes: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: changed some comments.) |
m (→{{header|REXX}}: changed a comment.) |
||
Line 2,861: | Line 2,861: | ||
do k=5 while s.k<=j /* [↓] divide by the known odd primes.*/ |
do k=5 while s.k<=j /* [↓] divide by the known odd primes.*/ |
||
if j // @.k == 0 then iterate j /*Is J ÷ X? Then not prime. ___ */ |
if j // @.k == 0 then iterate j /*Is J ÷ X? Then not prime. ___ */ |
||
end /*k*/ /* [↑] only process |
end /*k*/ /* [↑] only process numbers ≤ √ J */ |
||
#= #+1; @.#= j; s.#= j*j; !.j= 1 /*bump # of Ps; assign next P; P²; P# */ |
#= #+1; @.#= j; s.#= j*j; !.j= 1 /*bump # of Ps; assign next P; P²; P# */ |
||
end /*j*/ |
end /*j*/ |