Jump to content

Ascending primes: Difference between revisions

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

edits

Cookies help us deliver our services. By using our services, you agree to our use of cookies.