Pierpont primes: Difference between revisions
→{{header|Wren}}: Now uses new core library method.
(→{{header|Wren}}: Now uses new core library method.) |
|||
Line 2,842:
{{trans|Go}}
{{libheader|Wren-big}}
{{libheader|Wren-fmt}}
The 3-smooth version. Just the first 250 - a tolerable 14 seconds or so on my machine.
<lang ecmascript>import "/big" for BigInt
import "/fmt" for Fmt
Line 2,887 ⟶ 2,885:
count2 = count2 + 1
}
count =
}
}
Line 2,893 ⟶ 2,891:
}
var p = pierpont.call(250, true)
System.print("First 50 Pierpont primes of the first kind:")
Line 2,907 ⟶ 2,904:
System.print("\n250th Pierpont prime of the first kind: %(p[0][249])")
System.print("\n250th Pierpont prime of the second kind: %(p[1][249])")</lang>
{{out}}
| |||