Prime decomposition: Difference between revisions

Content deleted Content added
Miks1965 (talk | contribs)
PascalABC.NET
Zeddicus (talk | contribs)
Line 5,199: Line 5,199:
Since the majority of computing time is spent looking for primes, that part of the program was
Since the majority of computing time is spent looking for primes, that part of the program was
<br>optimized somewhat (but could be extended if more optimization is wanted).
<br>optimized somewhat (but could be extended if more optimization is wanted).
<syntaxhighlight lang="rexx"></syntaxhighlight>
<syntaxhighlight lang="rexx">
/*REXX pgm does prime decomposition of a range of positive integers (with a prime count)*/
/*REXX pgm does prime decomposition of a range of positive integers (with a prime count)*/
Numeric Digits 1000 /*handle thousand digits For the powers*/
Numeric Digits 1000 /*handle thousand digits For the powers*/
Line 5,282: Line 5,282:
End
End
Return t
Return t
</syntaxhighlight>
'''output''' &nbsp; when using the default input of: &nbsp; <tt> 1 &nbsp; 100 </tt>
'''output''' &nbsp; when using the default input of: &nbsp; <tt> 1 &nbsp; 100 </tt>