Anonymous user
Prime numbers which contain 123: Difference between revisions
m
→{{header|REXX}}: optimized the prime generation by elided the generating of prime semaphores.
SqrtNegInf (talk | contribs) m (→{{header|Perl}}: note use of 'theory' module) |
m (→{{header|REXX}}: optimized the prime generation by elided the generating of prime semaphores.) |
||
Line 492:
/*──────────────────────────────────────────────────────────────────────────────────────*/
genP: @.1=2; @.2=3; @.3=5; @.4=7; @.5=11 /*define some low primes. */
do j=@.#+2 by 2 to hi-1 /*find odd primes from here on. */
parse var j '' -1 _; if _==5 then iterate /*J divisible by 5? (right dig)*/
Line 501 ⟶ 500:
if j // @.k == 0 then iterate j /*Is J ÷ X? Then not prime. ___ */
end /*k*/ /* [↑] only process numbers ≤ √ J */
#= #+1; @.#= j; sq.#= j*j
end /*j*/;
{{out|output|text= when using the default inputs:}}
<pre>
| |||