Frobenius numbers: Difference between revisions
Content added Content deleted
SqrtNegInf (talk | contribs) (→{{header|Perl}}: added alternative method) |
Drkameleon (talk | contribs) (Added Arturo implementation) |
||
Line 56: | Line 56: | ||
{{out}} |
{{out}} |
||
<pre>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> |
<pre>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|Arturo}}== |
|||
<lang rebol>primes: select 0..10000 => prime? |
|||
frobenius: function [n] -> sub sub primes\[n] * primes\[n+1] primes\[n] primes\[n+1] |
|||
frob: 0 |
|||
lst: new [] |
|||
j: new 0 |
|||
while [frob < 10000] [ |
|||
'lst ++ frob: <= frobenius j |
|||
inc 'j |
|||
] |
|||
loop split.every:10 chop lst 'a -> |
|||
print map a => [pad to :string & 5]</lang> |
|||
{{out}} |
|||
<pre> 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|AWK}}== |
=={{header|AWK}}== |