Odd squarefree semiprimes: Difference between revisions
Content added Content deleted
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>
? "working..." + nl + "Odd squarefree semiprimes are:"
limit = 1000 Prim = []
# create table of prime numbers from 3 to 1000 / 3
pr = []
for n = 3 to 1000 / 3
if isprime(n) Add(pr,n) ok
next pl = len(pr)▼
▲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
{{out}}
<pre>working...
|