Ascending primes: Difference between revisions
Content added Content deleted
m (→{{header|J}}) |
m (sort is not needed with use of current Combinatorics version) |
||
| Line 131: | Line 131: | ||
function ascendingprimes() |
function ascendingprimes() |
||
return filter(isprime, [evalpoly(10, |
return filter(isprime, [evalpoly(10, reverse(x)) |
||
for x in powerset([1, 2, 3, 4, 5, 6, 7, 8, 9]) if !isempty(x)]) |
for x in powerset([1, 2, 3, 4, 5, 6, 7, 8, 9]) if !isempty(x)]) |
||
end |
end |
||
foreach(p -> print(rpad(p[2], 10), p[1] % 10 == 0 ? "\n" : ""), enumerate |
foreach(p -> print(rpad(p[2], 10), p[1] % 10 == 0 ? "\n" : ""), enumerate(ascendingprimes())) |
||
</lang>{{out}} |
</lang>{{out}} |
||
<pre> |
<pre> |
||