Descending primes: Difference between revisions

m
 
(One intermediate revision by one other user not shown)
Line 1,237:
len = 87</pre>
=={{header|Prolog}}==
{{works with|swi-prolog}}© 2023<syntaxhighlight lang="prolog">
<syntaxhighlight lang="prolog">
isPrime(2).
isPrime(N):-
Line 1,500 ⟶ 1,499:
{{libheader|Wren-perm}}
{{libheader|Wren-math}}
{{libheader|Wren-seq}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="ecmascriptwren">import "./perm" for Powerset
import "./math" for Int
import "./seq" for Lst
Line 1,513 ⟶ 1,511:
.sort()
System.print("There are %(descPrimes.count) descending primes, namely:")
for (chunk in Lst.chunks(descPrimes, 10)) Fmt.printtprint("$8s", chunkdescPrimes, 10)</syntaxhighlight>
 
{{out}}
51

edits