Odd squarefree semiprimes: Difference between revisions

m
→‎{{header|Ring}}: reverted to isprime() function call to create table
m (→‎{{header|Ring}}: removed formatting kludge, added function call to primitive string formatter)
m (→‎{{header|Ring}}: reverted to isprime() function call to create table)
Line 346:
 
=={{header|Ring}}==
<lang ring>?load "working..stdlib.ring" +# nlfor +isprime() "Odd squarefree semiprimes are:"function
? "working..." + nl + "Odd squarefree semiprimes are:"
limit = 1000 Prim = []
# create table of prime numbers from 3 to 1000 / 3
pr = []
pr = [ 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73,
for n = 3 to 1000 / 3
79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179,
if isprime(n) Add(pr,n) ok
181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283,
next pl = len(pr)
293, 307, 311, 313, 317, 331]
pl = len(pr)
# calculate upper limit for n
Line 383:
s = string(x) l = len(s)
if l > y y = l ok
return substr(" ", 11 - y + l) + s </lang>
{{out}}
<pre>working...