Erdös-Selfridge categorization of primes: Difference between revisions
Erdös-Selfridge categorization of primes (view source)
Revision as of 15:17, 6 April 2024
, 1 month agoadded RPL
Thundergnat (talk | contribs) m (syntax highlighting fixup automation) |
(added RPL) |
||
| (3 intermediate revisions by 3 users not shown) | |||
Line 579:
=={{header|Mathematica}}/{{header|Wolfram Language}}==
===Imperative implementation===
<syntaxhighlight lang="mathematica">ClearAll[SpecialPrimeFactors]
SpecialPrimeFactors[p_Integer] := FactorInteger[p + 1][[All, 1]]
Line 675 ⟶ 676:
10 1065601 15472321 28
11 8524807 8524807 1</pre>
===Functional implementation===
<syntaxhighlight lang="mathematica">ClearAll[ErdosSelfridgeCategory, CategorySizesTable, categories];
ErdosSelfridgeCategory[n_] := ErdosSelfridgeCategory[n] =
If[ Last[primesToCheck = FactorInteger[n + 1][[All, 1]]] <= 3,
1,
1 + Max[ErdosSelfridgeCategory /@ primesToCheck]
];
(* Display the first 200 primes allocated to their category *)
categories = GatherBy[Prime[Range[200]], ErdosSelfridgeCategory];
Print["First 200 primes by Erdös-Selfridge category:\n"]
Do[
Print["Class ", i, ":"];
Print[
TableForm[
Partition[
Map[StringPadLeft[ToString[#], 5] &, categories[[i]]], UpTo[12]],
TableAlignments -> Right]
],
{i, Length[categories]}
];
(* Show the number of primes in each category for the first million primes *)
Print["Calculating Erdős-Selfridge categories for the first million primes...."]
{seconds, categories} =
AbsoluteTiming[GatherBy[Prime[Range[10^6]], ErdosSelfridgeCategory]];
Print["Calculation took ", seconds " seconds."];
CategorySizesTable[categories_List] :=
TableForm[
Table[{Min[categories[[n]]], Max[categories[[n]]],
Length[categories[[n]]]}, {n, Length[categories]}],
TableHeadings -> {Automatic, {"First", "Last", "Count"}},
TableAlignments -> Right];
Print[CategorySizesTable[categories]]</syntaxhighlight>
{{out}}
<pre>
First 200 primes by Erdös-Selfridge category:
Class 1:
2 3 5 7 11 17 23 31 47 53 71 107
127 191 383 431 647 863 971 1151
Class 2:
13 19 29 41 43 59 61 67 79 83 89 97
101 109 131 137 139 149 167 179 197 199 211 223
229 239 241 251 263 269 271 281 283 293 307 317
349 359 367 373 419 433 439 449 461 479 499 503
509 557 563 577 587 593 599 619 641 643 659 709
719 743 751 761 769 809 827 839 881 919 929 953
967 991 1019 1033 1049 1069 1087 1103 1187 1223
Class 3:
37 103 113 151 157 163 173 181 193 227 233 257
277 311 331 337 347 353 379 389 397 401 409 421
457 463 467 487 491 521 523 541 547 569 571 601
607 613 631 653 683 701 727 733 773 787 797 811
821 829 853 857 859 877 883 911 937 947 983 997
1009 1013 1031 1039 1051 1061 1063 1091 1097 1117 1123 1153
1163 1171 1181 1193 1217
Class 4:
73 313 443 617 661 673 677 691 739 757 823 887
907 941 977 1093 1109 1129 1201 1213
Class 5:
1021
Calculating Erdős-Selfridge categories for the first million primes....
Calculation took 10.2376 seconds.
First Last Count
1 2 10616831 46
2 13 15482669 10497
3 37 15485863 201987
4 73 15485849 413891
5 1021 15485837 263109
6 2917 15485857 87560
7 15013 15484631 19389
8 49681 15485621 3129
9 532801 15472811 363
10 1065601 15472321 28
11 8524807 8524807 1
</pre>
=={{header|Nim}}==
{{trans|Wren}}
Translation of Wren program with some modifications. As we don’t use a library to find the prime factors, we defined our own function to return the list without duplicates.
The program runs in about 2.5 seconds.
<syntaxhighlight lang="Nim">import std/[bitops, math, sequtils, strformat, strutils, tables]
type Sieve = object
data: seq[byte]
func `[]`(sieve: Sieve; idx: Positive): bool =
## Return value of element at index "idx".
let idx = idx shr 1
let iByte = idx shr 3
let iBit = idx and 7
result = sieve.data[iByte].testBit(iBit)
func `[]=`(sieve: var Sieve; idx: Positive; val: bool) =
## Set value of element at index "idx".
let idx = idx shr 1
let iByte = idx shr 3
let iBit = idx and 7
if val: sieve.data[iByte].setBit(iBit)
else: sieve.data[iByte].clearBit(iBit)
func newSieve(lim: Positive): Sieve =
## Create a sieve with given maximal index.
result.data = newSeq[byte]((lim + 16) shr 4)
func initPrimes(lim: Positive): seq[Natural] =
## Initialize the list of primes from 2 to "lim".
var composite = newSieve(lim)
composite[1] = true
for n in countup(3, sqrt(lim.toFloat).int, 2):
if not composite[n]:
for k in countup(n * n, lim, 2 * n):
composite[k] = true
result.add 2
for n in countup(3, lim, 2):
if not composite[n]:
result.add n
const Limit = int(ln(1e6) * 1e6 * 1.2)
let primes = initPrimes(Limit)
func primeFactors(n: Positive): seq[Positive] =
## Return the list of prime factors of "n".
## Duplicate primes are excluded.
var n = n
var last = 0
while (n and 1) == 0:
if last != 2:
result.add 2
last = 2
n = n shr 1
var d = 3
while d * d <= n:
while n mod d == 0:
if last != d:
result.add d
last = d
n = n div d
inc d, 2
if n > 1: result.add n
type Category = 1..12
var prevCats: Table[int, int]
proc cat(p: Natural): Category =
## Recursive procedure to compute the catagory of "p".
if p in prevCats: return prevCats[p]
let pf = primeFactors(p + 1)
if pf.allIt(it == 2 or it == 3):
return 1
for c in 2..11:
if pf.allIt(cat(it) < c):
prevCats[p] = c
return c
result = 12
var es: array[Category, seq[Positive]]
echo "First 200 primes:\n"
for p in primes[0..199]:
es[p.cat].add p
for c in 1..6:
if es[c].len > 0:
echo &"Category {c}:"
echo es[c].join(" ")
echo()
echo "First million primes:\n"
for p in primes[200..999_999]:
es[p.cat].add p
for c in 1..12:
let e = es[c]
if e.len > 0:
echo &"Category {c:>2}: first = {e[0]:>7} last = {e[^1]:>8} count = {e.len:>6}"
</syntaxhighlight>
{{out}}
<pre>First 200 primes:
Category 1:
2 3 5 7 11 17 23 31 47 53 71 107 127 191 383 431 647 863 971 1151
Category 2:
13 19 29 41 43 59 61 67 79 83 89 97 101 109 131 137 139 149 167 179 197 199 211 223 229 239 241 251 263 269 271 281 283 293 307 317 349 359 367 373 419 433 439 449 461 479 499 503 509 557 563 577 587 593 599 619 641 643 659 709 719 743 751 761 769 809 827 839 881 919 929 953 967 991 1019 1033 1049 1069 1087 1103 1187 1223
Category 3:
37 103 113 151 157 163 173 181 193 227 233 257 277 311 331 337 347 353 379 389 397 401 409 421 457 463 467 487 491 521 523 541 547 569 571 601 607 613 631 653 683 701 727 733 773 787 797 811 821 829 853 857 859 877 883 911 937 947 983 997 1009 1013 1031 1039 1051 1061 1063 1091 1097 1117 1123 1153 1163 1171 1181 1193 1217
Category 4:
73 313 443 617 661 673 677 691 739 757 823 887 907 941 977 1093 1109 1129 1201 1213
Category 5:
1021
First million primes:
Category 1: first = 2 last = 10616831 count = 46
Category 2: first = 13 last = 15482669 count = 10497
Category 3: first = 37 last = 15485863 count = 201987
Category 4: first = 73 last = 15485849 count = 413891
Category 5: first = 1021 last = 15485837 count = 263109
Category 6: first = 2917 last = 15485857 count = 87560
Category 7: first = 15013 last = 15484631 count = 19389
Category 8: first = 49681 last = 15485621 count = 3129
Category 9: first = 532801 last = 15472811 count = 363
Category 10: first = 1065601 last = 15472321 count = 28
Category 11: first = 8524807 last = 8524807 count = 1
</pre>
=={{header|Perl}}==
Line 867 ⟶ 1,095:
Category 10: first: 1,065,601 last: 15,472,321 count: 28
Category 11: first: 8,524,807 last: 8,524,807 count: 1</pre>
=={{header|RPL}}==
{{works with|RPL|HP49-C}}
« 5 { { 2 3 } } 0 → catg f
« 1 ROT '''START'''
DUP 1 + FACTORS 0.
1 PICK3 SIZE '''FOR''' j
OVER j GET
'''IF''' DUP 3 ≤ '''THEN''' NOT
'''ELSE'''
'f' STO
catg 1. « f POS » DOLIST 0. > 1. POS
'''END'''
MAX
2 '''STEP'''
NIP 1 +
'''IF''' DUP catg SIZE ≤
'''THEN''' catg SWAP DUP2 GET 4 PICK + PUT 'catg' STO
'''ELSE''' DROP 'catg' OVER 1. →LIST 1. →LIST STO+ '''END'''
NEXTPRIME
'''NEXT'''
DROP catg
» » '<span style="color:blue">→ESCLASS</span>' STO
200 <span style="color:blue">→ESCLASS</span>'
{{out}}
<pre>
1: { { 2 3 5 7 11 17 23 31 47 53 71 107 127 191 383 431 647 863 971 1151 } { 13 19 29 41 43 59 61 67 79 83 89 97 101 109 131 137 139 149 167 179 197 199 211 223 229 239 241 251 263 269 271 281 283 293 307 317 349 359 367 373 419 433 439 449 461 479 499 503 509 557 563 577 587 593 599 619 641 643 659 709 719 743 751 761 769 809 827 839 881 919 929 953 967 991 1019 1033 1049 1069 1087 1103 1187 1223 1231 } { 37 103 113 151 157 163 173 181 193 227 233 257 277 311 331 337 347 353 379 389 397 401 409 421 457 463 467 487 491 521 523 541 547 569 571 601 607 613 631 653 683 701 727 733 773 787 797 811 821 829 853 857 859 877 883 911 937 947 983 997 1009 1013 1031 1039 1051 1061 1063 1091 1097 1117 1123 1153 1163 1171 1181 1193 1217 1229 } { 73 313 443 617 661 673 677 691 739 757 823 887 907 941 977 1093 1109 1129 1201 1213 } { 1021 } }
</pre>
=={{header|Rust}}==
Line 1,055 ⟶ 1,312:
{{libheader|Wren-fmt}}
Runs in about 23.5 seconds.
<syntaxhighlight lang="
import "./fmt" for Fmt
| |||