Frobenius numbers: Difference between revisions
Content added Content deleted
(→{{header|Ring}}: fixed off-by-one issue, removed warning) |
(→{{header|Ring}}: first number was missing all this time!) |
||
| Line 1,240: | Line 1,240: | ||
<lang ring>load "stdlib.ring" # for isprime() function |
<lang ring>load "stdlib.ring" # for isprime() function |
||
? "working..." + nl + "Frobenius numbers are:" |
? "working..." + nl + "Frobenius numbers are:" |
||
# create table of prime numbers between |
# create table of prime numbers between 2 and 101 inclusive |
||
Frob = [] |
Frob = [2] |
||
for n = 3 to 101 |
for n = 3 to 101 |
||
if isprime(n) Add(Frob,n) ok |
if isprime(n) Add(Frob,n) ok |
||
| Line 1,255: | Line 1,255: | ||
next |
next |
||
? nl + nl + "Found " + m + " Frobenius numbers" + nl + "done..." |
? nl + nl + "Found " + (m-1) + " Frobenius numbers" + nl + "done..." |
||
# a very plain string formatter, intended to even up columnar outputs |
# a very plain string formatter, intended to even up columnar outputs |
||
| Line 1,265: | Line 1,265: | ||
<pre>working... |
<pre>working... |
||
Frobenius numbers are: |
Frobenius numbers are: |
||
7 23 59 119 |
1 7 23 59 119 |
||
287 395 615 839 |
191 287 395 615 839 |
||
1439 1679 1931 2391 |
1079 1439 1679 1931 2391 |
||
3479 3959 4619 5039 |
3015 3479 3959 4619 5039 |
||
6395 7215 8447 9599 |
5615 6395 7215 8447 9599 |
||
Found 25 Frobenius numbers |
Found 25 Frobenius numbers |
||