Frobenius numbers: Difference between revisions
Content added Content deleted
(Added Sidef) |
(Frobenius numbers en BASIC256) |
||
Line 98: | Line 98: | ||
=={{header|Arturo}}== |
=={{header|Arturo}}== |
||
<lang rebol>primes: select 0..10000 => prime? |
<lang rebol>primes: select 0..10000 => prime? |
||
frobenius: function [n] -> sub sub primes\[n] * primes\[n+1] primes\[n] primes\[n+1] |
frobenius: function [n] -> sub sub primes\[n] * primes\[n+1] primes\[n] primes\[n+1] |
||
Line 178: | Line 177: | ||
3015 3479 3959 4619 5039 |
3015 3479 3959 4619 5039 |
||
5615 6395 7215 8447 9599</pre> |
5615 6395 7215 8447 9599</pre> |
||
=={{header|BASIC256}}== |
|||
<lang BASIC256> |
|||
n = 0 |
|||
lim = 10000 |
|||
k = sqr(lim) + 1 |
|||
dim P(k) |
|||
for i = 2 to sqr(k) |
|||
if P[i] = 0 then |
|||
for j = i + i to k step i |
|||
P[j] = 1 |
|||
next j |
|||
end if |
|||
next i |
|||
for i = 2 to k-1 |
|||
if P[i] = 0 then P[n] = i: n += 1 |
|||
next i |
|||
for i = 0 to n - 2 |
|||
print i+1; " => "; P[i] * P[i + 1] - P[i] - P[i + 1] |
|||
next i |
|||
end |
|||
</lang> |
|||
=={{header|BCPL}}== |
=={{header|BCPL}}== |