Anonymous user
Frobenius numbers: Difference between revisions
→{{header|Haskell}}: added solution
Alextretyak (talk | contribs) m (→{{header|11l}}) |
(→{{header|Haskell}}: added solution) |
||
Line 761:
25 such numbers found.
</pre>
=={{header|Haskell}}==
<lang haskell>primes = 2 : sieve [3,5..]
where sieve (x:xs) = x : sieve (filter (\y -> y `mod` x /= 0) xs)
frobenius = zipWith (\a b -> a*b - a - b) primes (tail primes)</lang>
<pre>λ> takeWhile (< 10000) frobenius
[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]</pre>
=={{header|J}}==
| |||