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: | Line 346: | ||
=={{header|Ring}}== |
=={{header|Ring}}== |
||
<lang ring> |
<lang ring>load "stdlib.ring" # for isprime() function |
||
? "working..." + nl + "Odd squarefree semiprimes are:" |
|||
limit = 1000 Prim = [] |
limit = 1000 Prim = [] |
||
# table of prime numbers from 3 to 1000/3 |
# 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, |
|||
⚫ | |||
293, 307, 311, 313, 317, 331] |
|||
⚫ | |||
# calculate upper limit for n |
# calculate upper limit for n |
||
Line 383: | Line 383: | ||
s = string(x) l = len(s) |
s = string(x) l = len(s) |
||
if l > y y = l ok |
if l > y y = l ok |
||
return substr(" ", 11 - y + l) + s |
return substr(" ", 11 - y + l) + s</lang> |
||
{{out}} |
{{out}} |
||
<pre>working... |
<pre>working... |