Factorial primes: Difference between revisions
Content added Content deleted
(Added link to related task.) |
(→{{header|Wren}}: More efficient basic version.) |
||
| Line 151: | Line 151: | ||
var c = 0 |
var c = 0 |
||
var i = 1 |
var i = 1 |
||
var f = 1 |
|||
while (true) { |
while (true) { |
||
var f = Int.factorial(i) |
|||
if (Int.isPrime(f-1)) { |
if (Int.isPrime(f-1)) { |
||
Fmt.print("$2d: $2d! - 1 = $d", c = c + 1, i, f - 1) |
Fmt.print("$2d: $2d! - 1 = $d", c = c + 1, i, f - 1) |
||
| Line 162: | Line 162: | ||
} |
} |
||
i = i + 1 |
i = i + 1 |
||
f = f * i |
|||
}</lang> |
}</lang> |
||
| Line 190: | Line 191: | ||
var f = Mpz.one |
var f = Mpz.one |
||
System.print("First %(limit) factorial primes;") |
System.print("First %(limit) factorial primes;") |
||
while (true) { |
while (true) { |
||
f.mul(i) |
f.mul(i) |
||