Frobenius numbers: Difference between revisions
Content added Content deleted
m (→{{header|C#|CSharp}}: marked (with an asterisk) the non-primes among the numbers) |
(Add Factor) |
||
| Line 52: | Line 52: | ||
Calculated 167 Frobenius numbers of consecutive primes under 1,000,000,of which 25 were under 10,000</pre> |
Calculated 167 Frobenius numbers of consecutive primes under 1,000,000,of which 25 were under 10,000</pre> |
||
=={{header|Factor}}== |
|||
{{works with|Factor|0.99 2021-02-05}} |
|||
<lang factor>USING: io kernel lists lists.lazy math math.primes prettyprint ; |
|||
"Frobenius numbers < 10,000:" print |
|||
2 3 [ |
|||
[ nip dup next-prime ] [ * ] [ [ - ] dip - ] 2tri |
|||
dup 10,000 < |
|||
] [ . ] while 3drop</lang> |
|||
{{out}} |
|||
<pre style="height:14em"> |
|||
Frobenius numbers < 10,000: |
|||
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|REXX}}== |
=={{header|REXX}}== |
||