Odd squarefree semiprimes: Difference between revisions
m
→{{header|Ring}}: removed formatting kludge, added function call to primitive string formatter
m (C# - Edited code & output to reflect new task name) |
m (→{{header|Ring}}: removed formatting kludge, added function call to primitive string formatter) |
||
Line 348:
<lang ring>? "working..." + nl + "Odd squarefree semiprimes are:"
limit = 1000 Prim = []
# table of prime numbers from 3 to 1000/3
pr = [ 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73,
181,
293, 307, 311, 313, 317, 331]
pl = len(pr)
# calculate upper limit for n
for nlim = 1 to pl
if pr[nlim] * pr[nlim] > limit exit ok
next nlim--▼
next▼
▲nlim--
# add items to result list and sort
for n = 1 to nlim
for m = n + 1 to pl
amt = pr[n] * pr[m]
if amt > limit exit ok
exit▼
add(Prim, amt)
next
next Prim = sort(Prim)▼
▲Prim = sort(Prim)
# display results
for n = 1 to len(Prim)
if n % 20 = 0 see
▲next n--
# a very plain string formatter, intended to even up columnar outputs
def sf x, y
s = string(x) l = len(s)
▲? nl + "Found " + n + " Odd squarefree semiprimes." + nl + "done..."</lang>
return substr(" ", 11 - y + l) + s </lang>
{{out}}
<pre>working...
Line 406 ⟶ 397:
817 831 835 843 849 851 865 869 871 879 889 893 895 899 901 905 913 917 921 923
933 939 943 949 951 955 959 965 973 979 985 989 993 995
Found 194 Odd squarefree semiprimes.
done...
</pre>
=={{header|Wren}}==
| |||