Frobenius numbers: Difference between revisions
m
Output fixes
(Added Java solution) |
m (Output fixes) |
||
Line 141:
<lang fermat>Function Frobenius(n)=Prime(n)*Prime(n+1)-Prime(n)-Prime(n+1).
for n = 1 to 25 do !!Frobenius(n) od</lang>
{{out}}
<pre>
1
7
Line 182 ⟶ 183:
end if
next i</lang>
{{out}}
<pre>
1 1
2 7
Line 207 ⟶ 209:
23 7215
24 8447
25 9599
</pre>
=={{header|J}}==
| |||