Rosetta Code

Sequence of primorial primes: Difference between revisions

Page Discussion

Sequence of primorial primes (view source)

Revision as of 08:56, 15 August 2022

184 bytes removed ,  1 year ago
→‎Embedded (GMP): Less repetitious.
(→‎{{header|Wren}}: Added an embedded version (merged from another removed draft task).)
(→‎Embedded (GMP): Less repetitious.)
Line 3,175:
while (true) {
var r = (p < two64) ? 1 : 0 // test for definite primeness below 2^64
iffor ((qs in [[p-1).probPrime(15), >"-"], [p+1, r"+"]]) {
varif s(qs[0].probPrime(15) => (p-1r).toString {
var scs = sqs[0].counttoString
var digs = sc >var 40 ? "(%(sc) digits)" := ""s.count
var pndigs = sc > 40 ? "p(%(isc)# digits)" : ""
Fmt.print("$2d: $5s - 1 =var $20a $s", cpn = c + 1, pn, s, digs"p%(i)#"
Fmt.print("$2d: $5s +$s 1 = $20a $s", c = c + 1, pn, qs[1], s, digs)▼
if (c == limit) return
}
if ((p+1).probPrime(15) > r) {}
var s = (p+1).toString
var sc = s.count
var digs = sc > 40 ? "(%(sc) digits)" : ""
var pn = "p%(i)#"
▲ Fmt.print("$2d: $5s + 1 = $20a $s", c = c + 1, pn, s, digs)
if (c == limit) return
}
p.mul(primes[i])
PureFox
9,482

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/259423"