Primality by Wilson's theorem: Difference between revisions
→{{header|Wren}}: Rewritten to use GMP.
(→{{header|Wren}}: Rewritten to use GMP.) |
|||
Line 2,582:
=={{header|Wren}}==
{{libheader|Wren-
{{libheader|Wren-fmt}}
<syntaxhighlight lang="wren">import "./gmp" for Mpz
var t = Mpz.new()
var wilson = Fn.new { |p|
if (p < 2) return false
return (
}
var primes = [2]
var i = 3
Fmt.print("$2d -> $s", p, wilson.call(p) ? "prime" : "not prime")▼
while (primes.count < 1015) {
if (wilson.call(i)) primes.add(i)
i = i + 2
}
var candidates = [2, 3, 9, 15, 29, 37, 47, 57, 67, 77, 87, 97, 237, 409, 659]
System.print(" n | prime?\n------------")
▲for (cand in candidates) Fmt.print("$
System.print("\nThe first 120 prime numbers by Wilson's theorem are:")
Fmt.tprint("$3d", primes[0..119], 20)
System.print("\nThe 1,000th to 1,015th prime numbers are:")
System.print(primes[-16..-1].join(" "))</syntaxhighlight>
{{out}}
<pre>
------------
2 | true
3 | true
9 | false
15 | false
37 | true
47 | true
57 | false
67 | true
77 | false
87 | false
97 | true
237 | false
409 | true
659 | true
The first 120 prime numbers by Wilson's theorem are:
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71
73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173
179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281
283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409
419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541
547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659
The 1,000th to 1,015th prime numbers are:
7919 7927 7933 7937 7949 7951 7963 7993 8009 8011 8017 8039 8053 8059 8069 8081
</pre>
| |||