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