Frobenius numbers: Difference between revisions
Content added Content deleted
m (→{{header|REXX}}: added the computer programming language REXX.) |
m (added whitespace.) |
||
| Line 5: | Line 5: | ||
a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''prime(n) < 10,000''' |
a(n) = prime(n)*prime(n+1) - prime(n) - prime(n+1), where '''prime(n) < 10,000''' |
||
<br><br> |
<br><br> |
||
=={{header|REXX}}== |
=={{header|REXX}}== |
||
<lang rexx>/*REXX program finds Frobenius numbers where the numbers are less than some number N. */ |
<lang rexx>/*REXX program finds Frobenius numbers where the numbers are less than some number N. */ |
||