Prime numbers whose neighboring pairs are tetraprimes: Difference between revisions

Content added Content deleted
(→‎{{header|ALGOL 68}}: Fix max prime)
(→‎{{header|Wren}}: More efficient way to check for duplicates.)
Line 637: Line 637:
<syntaxhighlight lang="ecmascript">import "./math" for Int, Nums
<syntaxhighlight lang="ecmascript">import "./math" for Int, Nums
import "./sort" for Find
import "./sort" for Find
import "./seq" for Lst
import "./seq" for Seq
import "./fmt" for Fmt
import "./fmt" for Fmt


Line 651: Line 651:
for (p in primes) {
for (p in primes) {
var pf1 = Int.primeFactors(p-2)
var pf1 = Int.primeFactors(p-2)
var cond1 = pf1.count == 4 && Lst.distinct(pf1).count == 4
var cond1 = pf1.count == 4 && !Seq.hasAdjDup(pf1)


var pf2 = Int.primeFactors(p-1)
var pf2 = Int.primeFactors(p-1)
var cond2 = pf2.count == 4 && Lst.distinct(pf2).count == 4
var cond2 = pf2.count == 4 && !Seq.hasAdjDup(pf2)


var pf3 = Int.primeFactors(p+1)
var pf3 = Int.primeFactors(p+1)
var cond3 = pf3.count == 4 && Lst.distinct(pf3).count == 4
var cond3 = pf3.count == 4 && !Seq.hasAdjDup(pf3)


var pf4 = Int.primeFactors(p+2)
var pf4 = Int.primeFactors(p+2)
var cond4 = pf4.count == 4 && Lst.distinct(pf4).count == 4
var cond4 = pf4.count == 4 && !Seq.hasAdjDup(pf4)


if (cond1 && cond2) {
if (cond1 && cond2) {
Retrieved from "https://rosettacode.org/wiki/Prime_numbers_whose_neighboring_pairs_are_tetraprimes"