Skip to content

xayahrainie4793/minimal-elements-of-the-prime-numbers

main
Switch branches/tags

Name already in use

A tag already exists with the provided branch name. Many Git commands accept both tag and branch names, so creating this branch may cause unexpected behavior. Are you sure you want to create this branch?
Go to file
Code

Files

Permalink
Failed to load latest commit information.
Type
Name
Latest commit message
Commit time
Dec 14, 2022
Sep 14, 2022
Sep 14, 2022
Nov 19, 2022
Nov 5, 2022
Dec 3, 2022
Dec 1, 2022
Nov 27, 2022
Nov 19, 2022
Sep 5, 2022
Dec 3, 2022
Nov 27, 2022
Dec 6, 2022
x19
Aug 17, 2022

A Prime Game:

Write down a multidigit prime number (i.e. a prime number > 10), and I can always strike out 0 or more digits to get a prime in this list:

{11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}

e.g.

Write down the prime 149 → I can delete the digit 4, to get the prime 19

Write down the prime 439 → I can delete the digit 9, to get the prime 43

Write down the prime 857 → I can delete zero digits, to get the prime 857

Write down the prime 2081 → I can delete the digit 0, to get the prime 281

Write down the largest known double Mersenne prime 170141183460469231731687303715884105727 (2127−1) → I can delete all digits except the third-leftmost 1 and the second-rightmost 3, to get the prime 13

Write down the largest known Fermat prime 65537 → I can delete the 6 and the 3, to get the prime 557 (also I can choose to delete the 6 and two 5's, to get the prime 37) (also I can choose to delete two 5's and the 3, to get the prime 67) (also I can choose to delete the 6, one 5, and the 7, to get the prime 53)

Write down the famous repunit prime 1111111111111111111 (with 19 1's) → I can delete 17 1's, to get the prime 11

Write down the prime 1000000000000000000000000000000000000000000000000000000000007 (which is the next prime after 1060) → I can delete all 0's, to get the prime 17

Write down the prime 95801 → I can delete the 9, to get the prime 5801

Write down the prime 946969 → I can delete the first 9 and two 6's, to get the prime 499

Write down the prime 90000000581 → I can delete five 0's, the 5, and the 8, to get the prime 9001

Write down the prime 8555555555555555555551 → I can delete the 8 and nine 5's, to get the prime 555555555551

Now we extend this prime game to bases other than 10.

The minimal elements (https://en.wikipedia.org/wiki/Minimal_element) (https://mathworld.wolfram.com/MaximalElement.html for maximal element, the dual of minimal element, unfortunely there is no article "minimal element" in mathworld, a minimal element of a set under a partial ordering (https://en.wikipedia.org/wiki/Partially_ordered_set, https://mathworld.wolfram.com/PartialOrder.html) binary relation (https://en.wikipedia.org/wiki/Binary_relation, https://mathworld.wolfram.com/BinaryRelation.html) is a maximal element of the same set under its converse relation (https://en.wikipedia.org/wiki/Converse_relation), a converse relation of a partial ordering relation must also be a partial ordering relation) of the prime numbers (https://en.wikipedia.org/wiki/Prime_number, https://primes.utm.edu/glossary/xpage/Prime.html, https://www.rieselprime.de/ziki/Prime, https://mathworld.wolfram.com/PrimeNumber.html) which are > b written in the positional numeral system (https://en.wikipedia.org/wiki/Positional_numeral_system) with radix (https://en.wikipedia.org/wiki/Radix, https://primes.utm.edu/glossary/xpage/Radix.html, https://www.rieselprime.de/ziki/Base, https://mathworld.wolfram.com/Radix.html) b, as digit (https://en.wikipedia.org/wiki/Numerical_digit, https://www.rieselprime.de/ziki/Digit, https://mathworld.wolfram.com/Digit.html) strings (https://en.wikipedia.org/wiki/String_(computer_science), https://mathworld.wolfram.com/String.html) with subsequence (https://en.wikipedia.org/wiki/Subsequence, https://mathworld.wolfram.com/Subsequence.html) ordering (https://en.wikipedia.org/wiki/Partially_ordered_set, https://mathworld.wolfram.com/PartialOrder.html), for 2 ≤ b ≤ 36 (I stop at base 36 since this base is a maximum base for which it is possible to write the numbers with the symbols 0, 1, ..., 9 and A, B, ..., Z), using A−Z to represent digit values 10 to 35.

By the theorem that there are no infinite (https://en.wikipedia.org/wiki/Infinite_set, https://primes.utm.edu/glossary/xpage/Infinite.html, https://mathworld.wolfram.com/InfiniteSet.html) antichains (https://en.wikipedia.org/wiki/Antichain, https://mathworld.wolfram.com/Antichain.html) (i.e. a subset of a partially ordered set such that any two distinct elements in the subset are incomparable (https://en.wikipedia.org/wiki/Comparability, https://mathworld.wolfram.com/ComparableElements.html)) for the subsequence ordering, there must be only finitely such minimal elements in every base b.

This problem is an extension of the original minimal prime problem (https://cs.uwaterloo.ca/~cbright/reports/mepn.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_17.pdf), https://cs.uwaterloo.ca/~shallit/Papers/br10.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_18.pdf), https://cs.uwaterloo.ca/~cbright/talks/minimal-slides.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_19.pdf), https://doi.org/10.1080/10586458.2015.1064048 (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_20.pdf), https://scholar.colorado.edu/downloads/hh63sw661 (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_16.pdf), https://github.com/curtisbright/mepn-data, https://github.com/curtisbright/mepn, https://github.com/RaymondDevillers/primes) to cover Conjectures ‘R Us Sierpinski/Riesel conjectures base b (http://www.noprimeleftbehind.net/crus/, http://www.noprimeleftbehind.net/crus/Sierp-conjectures.htm, http://www.noprimeleftbehind.net/crus/Sierp-conjectures-powers2.htm, http://www.noprimeleftbehind.net/crus/Riesel-conjectures.htm, http://www.noprimeleftbehind.net/crus/Riesel-conjectures-powers2.htm, http://www.noprimeleftbehind.net/crus/Sierp-conjecture-reserves.htm, http://www.noprimeleftbehind.net/crus/Riesel-conjecture-reserves.htm, https://www.utm.edu/staff/caldwell/preprints/2to100.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_3.pdf)) with k-values < b, i.e. finding the smallest prime of the form k×bn+1 and k×bn−1 (or proving that such prime does not exist) for all k < b (also to cover dual (http://www.kurims.kyoto-u.ac.jp/EMIS/journals/INTEGERS/papers/i61/i61.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_1.pdf), https://www.rechenkraft.net/wiki/Five_or_Bust, https://oeis.org/A076336/a076336c.html, http://www.mit.edu/~kenta/three/prime/dual-sierpinski/ezgxggdm/dualsierp-excerpt.txt, https://mersenneforum.org/showthread.php?t=10761, https://mersenneforum.org/showthread.php?t=6545) Sierpinski/Riesel conjectures base b with k-values < b, i.e. finding the smallest prime of the form bn+k and bnk (which are the dual forms of k×bn+1 and k×bn−1, respectively) (or proving that such prime does not exist) for all k < b) (also to cover finding the smallest prime of some classic forms (or proving that such prime does not exist), such as bn+2, bn−2, bn+(b−1), bn−(b−1), 2×bn+1, 2×bn−1, (b−1)×bn+1, (b−1)×bn−1, with n ≥ 1, for the same base b (of course, for some bases b the original minimal prime base b problem already covers finding the smallest prime of these forms, e.g. the original minimal prime base b problem covers finding the smallest prime of the form (b−1)×bn+1 if and only if b−1 is not prime, and the original minimal prime base b problem covers finding the smallest prime of the form (b−1)×bn−1 if and only if neither b−1 nor b−2 is prime, but I want the problem covers finding the smallest prime of these forms for all bases b)). The original minimal prime base b problem does not cover Conjectures ‘R Us Sierpinski/Riesel conjectures base b with conjectured k (http://www.noprimeleftbehind.net/crus/tab/CRUS_tab.htm, http://www.noprimeleftbehind.net/crus/vstats/all_ck_sierpinski.txt, http://www.noprimeleftbehind.net/crus/vstats/all_ck_riesel.txt) < b, since in Riesel side, the prime is not minimal prime in original definition if either k−1 or b−1 (or both) is prime, and in Sierpinski side, the prime is not minimal prime in original definition if k is prime (e.g. 25×3034205−1 is not minimal prime in base 30 in original definition, since it is OT34205 in base 30, and T (= 29 in decimal) is prime, but it is minimal prime in base 30 if only primes > base are counted), but this extended version of minimal prime base b problem does.

However, including the base (b) itself results in automatic elimination of all possible extension numbers with "0 after 1" from the set (when the base is prime, if the base is composite, then there is no difference to include the base (b) itself or not), which is quite restrictive (since when the base is prime, then the base (b) itself is the only prime ending with 0, i.e. having trailing zero (https://en.wikipedia.org/wiki/Trailing_zero), since in any base, all numbers ending with 0 (i.e. having trailing zero) are divisible by the base (b), thus cannot be prime unless it is equal the base (b), i.e. "10" in base b, note that the numbers cannot have leading zero (https://en.wikipedia.org/wiki/Leading_zero), since typically this is not the way we write numbers (in any base), thus for all primes in our sets (i.e. all primes > base (b)), all zero digits must be "between" other digits).

Besides, this problem is better than the original minimal prime problem since this problem is regardless whether 1 is considered as prime or not, i.e. no matter 1 is considered as prime or not prime (https://primes.utm.edu/notes/faq/one.html, https://primefan.tripod.com/Prime1ProCon.html, https://cs.uwaterloo.ca/journals/JIS/VOL15/Caldwell2/cald6.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_24.pdf), http://www.numericana.com/answer/numbers.htm#one), the sets in this problem are the same, while the sets in the original minimal prime problem are different, e.g. in base 10, if 1 is considered as prime, then the set in the original minimal prime problem is {1, 2, 3, 5, 7, 89, 409, 449, 499, 6469, 6949, 9049, 9649, 9949, 60649, 666649, 946669, 60000049, 66000049, 66600049}, while if 1 is not considered as prime, then the set in the original minimal prime problem is {2, 3, 5, 7, 11, 19, 41, 61, 89, 409, 449, 499, 881, 991, 6469, 6949, 9001, 9049, 9649, 9949, 60649, 666649, 946669, 60000049, 66000049, 66600049}, however, in base 10, the set in this problem is always {11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 227, 251, 257, 277, 281, 349, 409, 449, 499, 521, 557, 577, 587, 727, 757, 787, 821, 827, 857, 877, 881, 887, 991, 2087, 2221, 5051, 5081, 5501, 5581, 5801, 5851, 6469, 6949, 8501, 9001, 9049, 9221, 9551, 9649, 9851, 9949, 20021, 20201, 50207, 60649, 80051, 666649, 946669, 5200007, 22000001, 60000049, 66000049, 66600049, 80555551, 555555555551, 5000000000000000000000000000027}, no matter 1 is considered as prime or not prime.

The third reason for excluding the primes ≤ b is that starting with b+1 makes the formula of the number of possible (first digit,last digit) combo of a minimal prime in base b more simple and smooth number (https://en.wikipedia.org/wiki/Smooth_number, https://mathworld.wolfram.com/SmoothNumber.html), it is (b−1)×eulerphi(b) (https://oeis.org/A062955), where eulerphi is Euler's totient function (https://en.wikipedia.org/wiki/Euler%27s_totient_function, https://primes.utm.edu/glossary/xpage/EulersPhi.html, https://mathworld.wolfram.com/TotientFunction.html, https://oeis.org/A000010), since b−1 is the number of possible first digit (except 0, all digits can be first digit), and eulerphi(b) is the number of possible last digit (only digits coprime to b can be last digit), by rule of product, there are (b−1)×eulerphi(b) possible (first digit,last digit) combo, and if start with b, then when b is prime, there is an additional possible (first digit,last digit) combo: (1,0), and hence the formula will be (b−1)×eulerphi(b)+1 if b is prime, or (b−1)×eulerphi(b) if b is composite (the fully formula will be (b−1)×eulerphi(b)+isprime(b) or (b−1)×eulerphi(b)+floor((beulerphi(b)) / (b−1))), which is more complex, and if start with 1 (i.e. the original minimal prime problem), the formula is much more complex.

This problem covers finding the smallest prime of these forms in the same base b (or proving that such prime does not exist): (while the original minimal prime problem does not cover some of these forms for some bases (or all bases) b)

family smallest allowed n OEIS sequences for the smallest n such that this form is prime references
(bn−1)/(b−1) 2 https://oeis.org/A084740
https://oeis.org/A084738 (corresponding primes)
https://oeis.org/A065854 (prime b)
https://oeis.org/A279068 (prime b, corresponding primes)
https://oeis.org/A128164 (n = 2 not allowed)
https://oeis.org/A285642 (n = 2 not allowed, corresponding primes)
http://www.fermatquotient.com/PrimSerien/GenRepu.txt
https://archive.vn/tf7jx
http://www.primenumbers.net/Henri/us/MersFermus.htm
https://www.ams.org/journals/mcom/1993-61-204/S0025-5718-1993-1185243-9/S0025-5718-1993-1185243-9.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_4.pdf)
bn+1 1 https://oeis.org/A228101 (log2 of n)
https://oeis.org/A079706
https://oeis.org/A084712 (corresponding primes)
https://oeis.org/A123669 (n = 1 not allowed, corresponding primes)
http://jeppesn.dk/generalized-fermat.html
http://www.noprimeleftbehind.net/crus/GFN-primes.htm
http://yves.gallot.pagesperso-orange.fr/primes/index.html
http://yves.gallot.pagesperso-orange.fr/primes/results.html
http://yves.gallot.pagesperso-orange.fr/primes/stat.html
(bn+1)/2 (for odd b) 2 http://www.fermatquotient.com/PrimSerien/GenFermOdd.txt
bn+1 1 https://oeis.org/A119624
https://oeis.org/A253178 (only bases b which have possible primes)
https://oeis.org/A098872 (b divisible by 6)
https://mersenneforum.org/showthread.php?t=6918
https://mersenneforum.org/showthread.php?t=19725 (b == 11 mod 12)
bn−1 1 https://oeis.org/A119591
https://oeis.org/A098873 (b divisible by 6)
https://mersenneforum.org/showthread.php?t=24576, https://www.mersenneforum.org/attachment.php?attachmentid=20976&d=1567314217
bn+2 1 https://oeis.org/A138066
https://oeis.org/A084713 (corresponding primes)
https://oeis.org/A138067 (n = 1 not allowed)
bn−2 2 https://oeis.org/A250200
https://oeis.org/A255707 (n = 1 allowed)
https://oeis.org/A084714 (n = 1 allowed, corresponding primes)
https://oeis.org/A292201 (prime b, n = 1 allowed)
https://www.primepuzzles.net/puzzles/puzz_887.htm (n = 1 allowed)
bn+1 1 https://oeis.org/A098877 (b divisible by 6)
bn−1 1 https://oeis.org/A098876 (b divisible by 6)
10×bn+1 1 https://oeis.org/A088782
https://oeis.org/A088622 (corresponding primes)
bn+3 1 https://www.primegrid.com/forum_thread.php?id=9538
bn/2+1 (for even b) 2 https://www.primegrid.com/forum_thread.php?id=9538
(b−1)×bn+1 1 https://oeis.org/A305531
https://oeis.org/A087139 (prime b, n replaced by n+1)
https://www.rieselprime.de/ziki/Williams_prime_MP_least
https://www.rieselprime.de/ziki/Williams_prime_MP_table
https://sites.google.com/view/williams-primes
http://www.bitman.name/math/table/477
(b−1)×bn−1 1 https://oeis.org/A122396 (prime b, n replaced by n+1) https://harvey563.tripod.com/wills.txt
https://www.rieselprime.de/ziki/Williams_prime_MM_least
https://www.rieselprime.de/ziki/Williams_prime_MM_table
https://sites.google.com/view/williams-primes
http://matwbn.icm.edu.pl/ksiazki/aa/aa39/aa3912.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_9.pdf)
https://www.ams.org/journals/mcom/2000-69-232/S0025-5718-00-01212-6/S0025-5718-00-01212-6.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_10.pdf)
http://www.bitman.name/math/table/484
bn+(b−1) 1 https://oeis.org/A076845
https://oeis.org/A076846 (corresponding primes)
https://oeis.org/A078178 (n = 1 not allowed)
https://oeis.org/A078179 (n = 1 not allowed, corresponding primes)
https://sites.google.com/view/williams-primes
bn−(b−1) 2 https://oeis.org/A113516
https://oeis.org/A343589 (corresponding primes)
https://sites.google.com/view/williams-primes
https://cs.uwaterloo.ca/journals/JIS/VOL3/mccranie.html (prime b)
http://www.bitman.name/math/table/435 (prime b)
k×bn+1 for all 2 ≤ k ≤ 12 1 https://www.rieselprime.de/ziki/Proth_prime_small_bases_least_n
https://mersenneforum.org/showthread.php?t=10354
k×bn−1 for all 2 ≤ k ≤ 12 1 https://www.rieselprime.de/ziki/Riesel_prime_small_bases_least_n
https://mersenneforum.org/showthread.php?t=10354

(below (as well as the "left b" files), family "12{3}45" means sequence {1245, 12345, 123345, 1233345, 12333345, 123333345, ...}, where the members are expressed as base b strings, like the numbers in https://stdkmd.net/nrr/aaaab.htm, https://stdkmd.net/nrr/abbbb.htm, https://stdkmd.net/nrr/aaaba.htm, https://stdkmd.net/nrr/abaaa.htm, https://stdkmd.net/nrr/abbba.htm, https://stdkmd.net/nrr/abbbc.htm, https://stdkmd.net/nrr/prime/primecount.txt, https://stdkmd.net/nrr/prime/primedifficulty.txt, e.g. 1{3} (in decimal) is the numbers in https://stdkmd.net/nrr/1/13333.htm, and {1}3 (in decimal) is the numbers in https://stdkmd.net/nrr/1/11113.htm)

In fact, this problem covers finding the smallest prime of these form in the same base b: (where x, y, z are any digits in base b)

x{0}y

x{y} (unless y = 1) (see https://stdkmd.net/nrr/abbbb.htm)

{x}y (unless x = 1) (see https://stdkmd.net/nrr/aaaab.htm)

x{0}yz (unless there is a prime of the form x{0}y or x{0}z)

xy{0}z (unless there is a prime of the form x{0}z or y{0}z)

xy{x} (unless either x = 1 or there is a prime of the form y{x} (or both)) (see https://stdkmd.net/nrr/abaaa.htm)

{x}yx (unless either x = 1 or there is a prime of the form {x}y (or both)) (see https://stdkmd.net/nrr/aaaba.htm)

Some x{y}z (where x and z are strings (may be empty) of digits in base b, y is a digit in base b) families can be proven to contain no primes > b, by covering congruence (http://irvinemclean.com/maths/siercvr.htm, https://archive.vn/WSV3X, https://en.wikipedia.org/wiki/Covering_set, https://mathworld.wolfram.com/SierpinskisCompositeNumberTheorem.html), algebraic factorization (https://en.wikipedia.org/wiki/Factorization_of_polynomials, https://mathworld.wolfram.com/PolynomialFactorization.html), or combine of them, e.g. (only list the families which all numbers do not contain "prime > b" subsequence) (see post https://mersenneforum.org/showpost.php?p=594923&postcount=231 for the factor pattern for some of these families) (for the case of covering congruence, we can show that the corresponding numbers are > all elements in the sets if the corresponding numbers are > b, thus these factorizations are nontrivial; and for the case of algebraic factorization, we can show that both factors are > 1 if the corresponding numbers are > b, thus these factorizations are nontrivial; for the case of combine of them, we can show that for the part of covering congruence, the corresponding numbers are > all elements in the sets if the corresponding numbers are > b, and for the part of algebraic factorization, both factors are > 1 if the corresponding numbers are > b, thus these factorizations are nontrivial)

b family why this family contain no primes > b
10 2{0}1 always divisible by 3
10 2{0}7 always divisible by 3
(in fact, always divisible by 9)
10 5{0}1 always divisible by 3
10 5{0}7 always divisible by 3
10 8{0}1 always divisible by 3
(in fact, always divisible by 9)
10 8{0}7 always divisible by 3
10 28{0}7 always divisible by 7
10 4{6}9 always divisible by 7
10 families ending with 0, 2, 4, 6, or 8 always divisible by 2
10 families ending with 0 or 5 always divisible by 5
10 {0,3,6,9} always divisible by 3
(non-simple family)
10 {0,7} always divisible by 7
(non-simple family)
any base (b) families ending with digits d which are not coprime to b always divisible by gcd(d,b)
any base (b) families whose digits all have a common factor d > 1 always divisible by d
3 1{0}1 always divisible by 2
4 2{0}1 always divisible by 3
5 1{0}1 always divisible by 2
5 1{0}3 always divisible by 2
(in fact, always divisible by 4)
5 3{0}1 always divisible by 2
(in fact, always divisible by 4)
5 11{0}3 always divisible by 3
5 3{0}11 always divisible by 3
6 4{0}1 always divisible by 5
7 1{0}1 always divisible by 2
7 1{0}3 always divisible by 2
7 1{0}5 always divisible by 2
(in fact, always divisible by 6)
7 3{0}1 always divisible by 2
7 3{0}5 always divisible by 2
7 5{0}1 always divisible by 2
(in fact, always divisible by 6)
7 5{0}3 always divisible by 2
7 1{0}2 always divisible by 3
7 2{0}1 always divisible by 3
7 4{0}5 always divisible by 3
7 5{0}4 always divisible by 3
7 1{0}1{0}1 always divisible by 3
(non-simple family)
7 1{0}3{0}5 always divisible by 3
(non-simple family)
7 1{0}5{0}3 always divisible by 3
(non-simple family)
7 3{0}1{0}5 always divisible by 3
(non-simple family)
7 3{0}5{0}1 always divisible by 3
(non-simple family)
7 5{0}1{0}3 always divisible by 3
(non-simple family)
7 5{0}3{0}1 always divisible by 3
(non-simple family)
8 2{0}5 always divisible by 7
8 4{0}3 always divisible by 7
8 6{0}1 always divisible by 7
8 44{0}3 always divisible by 3
8 6{0}11 always divisible by 3
9 {7}62 always divisible by 7
12 A{0}21 always divisible by 5
13 C{A}5 always divisible by 7
14 40{4}9 always divisible by 61
15 9{6}8 always divisible by 11
16 2{C}3 always divisible by 7
21 B0{H}6H always divisible by 4637
28 4{O}9 always divisible by 11
28 D{6}R always divisible by 17
28 N{6}R always divisible by 11
9 {1}5 always divisible by some element of {2,5}
divisible by 2 if the length is even, divisible by 5 if the length is odd
9 {1}61 always divisible by some element of {2,5}
divisible by 2 if the length is even, divisible by 5 if the length is odd
9 2{7} always divisible by some element of {2,5}
divisible by 2 if the length is odd, divisible by 5 if the length is even
9 {3}5 always divisible by some element of {2,5}
divisible by 2 if the length is even, divisible by 5 if the length is odd
9 {3}8 always divisible by some element of {2,5}
divisible by 2 if the length is odd, divisible by 5 if the length is even
9 {3}05 always divisible by some element of {2,5}
divisible by 2 if the length is odd, divisible by 5 if the length is even
9 5{1} always divisible by some element of {2,5}
divisible by 2 if the length is even, divisible by 5 if the length is odd
9 5{7} always divisible by some element of {2,5}
divisible by 2 if the length is even, divisible by 5 if the length is odd
9 6{1} always divisible by some element of {2,5}
divisible by 2 if the length is odd, divisible by 5 if the length is even
9 {7}2 always divisible by some element of {2,5}
divisible by 2 if the length is odd, divisible by 5 if the length is even
9 {7}5 always divisible by some element of {2,5}
divisible by 2 if the length is even, divisible by 5 if the length is odd
9 {7}05 always divisible by some element of {2,5}
divisible by 2 if the length is odd, divisible by 5 if the length is even
9 {1}6{1} always divisible by some element of {2,5}
(non-simple family)
divisible by 2 if the length is odd, divisible by 5 if the length is even
9 {7}2{7} always divisible by some element of {2,5}
(non-simple family)
divisible by 2 if the length is odd, divisible by 5 if the length is even
9 5{0}{7} always divisible by some element of {2,5}
(non-simple family)
divisible by 2 if the number of 7's is odd, divisible by 5 if the number of 7's is even
9 {3}{0}5 always divisible by some element of {2,5}
(non-simple family)
divisible by 2 if the number of 3's is odd, divisible by 5 if the number of 3's is even
9 {7}{0}5 always divisible by some element of {2,5}
(non-simple family)
divisible by 2 if the number of 7's is odd, divisible by 5 if the number of 7's is even
11 2{5} always divisible by some element of {2,3}
divisible by 2 if the length is odd, divisible by 3 if the length is even
11 3{5} always divisible by some element of {2,3}
divisible by 2 if the length is even, divisible by 3 if the length is odd
11 3{7} always divisible by some element of {2,3}
divisible by 2 if the length is even, divisible by 3 if the length is odd
11 4{7} always divisible by some element of {2,3}
divisible by 2 if the length is odd, divisible by 3 if the length is even
11 8{5} always divisible by some element of {2,3}
divisible by 2 if the length is odd, divisible by 3 if the length is even
11 9{5} always divisible by some element of {2,3}
divisible by 2 if the length is even, divisible by 3 if the length is odd
11 9{7} always divisible by some element of {2,3}
divisible by 2 if the length is even, divisible by 3 if the length is odd
11 A{7} always divisible by some element of {2,3}
divisible by 2 if the length is odd, divisible by 3 if the length is even
11 {5}2 always divisible by some element of {2,3}
divisible by 2 if the length is odd, divisible by 3 if the length is even
11 {5}3 always divisible by some element of {2,3}
divisible by 2 if the length is even, divisible by 3 if the length is odd
11 {7}3 always divisible by some element of {2,3}
divisible by 2 if the length is even, divisible by 3 if the length is odd
11 {7}4 always divisible by some element of {2,3}
divisible by 2 if the length is odd, divisible by 3 if the length is even
11 {5}8 always divisible by some element of {2,3}
divisible by 2 if the length is odd, divisible by 3 if the length is even
11 {5}9 always divisible by some element of {2,3}
divisible by 2 if the length is even, divisible by 3 if the length is odd
11 {7}9 always divisible by some element of {2,3}
divisible by 2 if the length is even, divisible by 3 if the length is odd
11 {7}A always divisible by some element of {2,3}
divisible by 2 if the length is odd, divisible by 3 if the length is even
11 3{0}{5} always divisible by some element of {2,3}
(non-simple family)
divisible by 2 if the number of 5's is odd, divisible by 3 if the number of 5's is even
11 {5}{0}3 always divisible by some element of {2,3}
(non-simple family)
divisible by 2 if the number of 5's is odd, divisible by 3 if the number of 5's is even
14 4{0}1 always divisible by some element of {3,5}
divisible by 3 if the length is even, divisible by 5 if the length is odd
14 B{0}1 always divisible by some element of {3,5}
divisible by 3 if the length is odd, divisible by 5 if the length is even
14 3{D} always divisible by some element of {3,5}
divisible by 3 if the length is odd, divisible by 5 if the length is even
14 A{D} always divisible by some element of {3,5}
divisible by 3 if the length is even, divisible by 5 if the length is odd
14 1{0}B always divisible by some element of {3,5}
divisible by 3 if the length is odd, divisible by 5 if the length is even
14 {D}3 always divisible by some element of {3,5}
divisible by 3 if the length is odd, divisible by 5 if the length is even
14 {4}9 always divisible by some element of {3,5}
divisible by 3 if the length is odd, divisible by 5 if the length is even
14 {8}5 always divisible by some element of {3,5}
divisible by 3 if the length is even, divisible by 5 if the length is odd
20 8{0}1 always divisible by some element of {3,7}
divisible by 3 if the length is odd, divisible by 7 if the length is even
20 D{0}1 always divisible by some element of {3,7}
divisible by 3 if the length is even, divisible by 7 if the length is odd
20 7{J} always divisible by some element of {3,7}
divisible by 3 if the length is even, divisible by 7 if the length is odd
20 C{J} always divisible by some element of {3,7}
divisible by 3 if the length is odd, divisible by 7 if the length is even
20 1{0}D always divisible by some element of {3,7}
divisible by 3 if the length is even, divisible by 7 if the length is odd
20 {J}7 always divisible by some element of {3,7}
divisible by 3 if the length is even, divisible by 7 if the length is odd
32 A{0}1 always divisible by some element of {3,11}
divisible by 3 if the length is even, divisible by 11 if the length is odd
32 N{0}1 always divisible by some element of {3,11}
divisible by 3 if the length is odd, divisible by 11 if the length is even
32 9{V} always divisible by some element of {3,11}
divisible by 3 if the length is odd, divisible by 11 if the length is even
32 M{V} always divisible by some element of {3,11}
divisible by 3 if the length is even, divisible by 11 if the length is odd
32 1{0}N always divisible by some element of {3,11}
divisible by 3 if the length is odd, divisible by 11 if the length is even
32 {V}9 always divisible by some element of {3,11}
divisible by 3 if the length is odd, divisible by 11 if the length is even
34 6{0}1 always divisible by some element of {5,7}
divisible by 5 if the length is even, divisible by 7 if the length is odd
34 5{X} always divisible by some element of {5,7}
divisible by 5 if the length is odd, divisible by 7 if the length is even
34 S{X} always divisible by some element of {5,7}
divisible by 5 if the length is even, divisible by 7 if the length is odd
34 {X}5 always divisible by some element of {5,7}
divisible by 5 if the length is odd, divisible by 7 if the length is even
8 6{4}7 always divisible by some element of {3,5,13}
divisible by 3 if the length is odd, divisible by 5 if the length is == 2 mod 4, divisible by 13 if the length is == 0 mod 4
(special example, as the numbers with length ≥ 222 in this family contain "prime > b" subsequence, this prime is 42207)
13 3{0}95 always divisible by some element of {5,7,17}
divisible by 7 if the length is even, divisible by 5 if the length is == 1 mod 4, divisible by 17 if the length is == 3 mod 4
13 95{0}3 always divisible by some element of {5,7,17}
divisible by 7 if the length is odd, divisible by 5 if the length is == 2 mod 4, divisible by 17 if the length is == 0 mod 4
16 {4}D always divisible by some element of {3,7,13}
divisible by 3 if the length is == 0 mod 3, divisible by 7 if the length is == 2 mod 3, divisible by 13 if the length is == 1 mod 3
16 {8}F always divisible by some element of {3,7,13}
divisible by 3 if the length is == 1 mod 3, divisible by 7 if the length is == 0 mod 3, divisible by 13 if the length is == 2 mod 3
17 7F{0}D always divisible by some element of {3,5,29}
divisible by 3 if the length is even, divisible by 5 if the length is == 1 mod 4, divisible by 29 if the length is == 3 mod 4
17 D{0}7F always divisible by some element of {3,5,29}
divisible by 3 if the length is odd, divisible by 5 if the length is == 2 mod 4, divisible by 29 if the length is == 0 mod 4
21 {7}D always divisible by some element of {2,13,17}
divisible by 2 if the length is even, divisible by 13 if the length is == 1 mod 4, divisible by 17 if the length is == 3 mod 4
23 7L{0}1 always divisible by some element of {3,5,53}
divisible by 3 if the length is even, divisible by 5 if the length is == 1 mod 4, divisible by 53 if the length is == 3 mod 4
23 1{0}7L always divisible by some element of {3,5,53}
divisible by 3 if the length is odd, divisible by 5 if the length is == 2 mod 4, divisible by 53 if the length is == 0 mod 4
23 {D}GA always divisible by some element of {2,5,7,37,79}
divisible by 2 if the length is even, divisible by 5 if the length is == 3 mod 4, divisible by 7 if the length is == 2 mod 3, divisible by 37 if the length is == 9 mod 12, divisible by 79 if the length is == 1 mod 3
23 L{5}L always divisible by some element of {2,5,7,13,37}
divisible by 2 if the length is even, divisible by 5 if the length is == 3 mod 4, divisible by 7 if the length is == 2 mod 3, divisible by 13 if the length is == 3 mod 6, divisible by 37 if the length is == 1 mod 12
27 JP{0}1 always divisible by some element of {5,7,73}
divisible by 7 if the length is even, divisible by 5 if the length is == 1 mod 4, divisible by 73 if the length is == 3 mod 4
27 1{0}JP always divisible by some element of {5,7,73}
divisible by 7 if the length is odd, divisible by 5 if the length is == 2 mod 4, divisible by 73 if the length is == 0 mod 4
27 J{0}2 always divisible by some element of {5,7,73}
divisible by 7 if the length is odd, divisible by 5 if the length is == 2 mod 4, divisible by 73 if the length is == 0 mod 4
29 {2}{5} always divisible by some element of {2,3,5}
(non-simple family)
divisible by 2 if the number of 5's is even, divisible by 3 if the number of 2's and the number of 5's are both even or both odd, divisible by 5 if the number of 2's is even
30 A{0}9J always divisible by some element of {7,13,19,31}
divisible by 7 if the length is == 0 mod 3, divisible by 13 if the length is == 1 mod 6, divisible by 19 if the length is == 2 mod 3, divisible by 31 if the length is even
31 O{5} always divisible by some element of {2,3,7,19}
divisible by 2 if the length is odd, divisible by 3 if the length is == 1 mod 3, divisible by 7 if the length is 2 mod 6, divisible by 19 if the length is == 0 mod 6
32 8{0}V always divisible by some element of {3,5,41}
divisible by 3 if the length is odd, divisible by 5 if the length is == 0 mod 4, divisible by 41 if the length is == 2 mod 4
32 {G}L always divisible by some element of {3,5,41}
divisible by 3 if the length is odd, divisible by 5 if the length is == 0 mod 4, divisible by 41 if the length is == 2 mod 4
9 {1} difference-of-squares factorization
(9n−1)/8 = (3n−1) × (3n+1) / 8
8 1{0}1 sum-of-cubes factorization
8n+1 = (2n+1) × (4n−2n+1)
9 3{1} difference-of-squares factorization
(25×9n−1)/8 = (5×3n−1) × (5×3n+1) / 8
9 3{8} difference-of-squares factorization
4×9n−1 = (2×3n−1) × (2×3n+1)
9 {8}5 difference-of-squares factorization
9n−4 = (3n−2) × (3n+2)
9 3{8}35 difference-of-squares factorization
4×9n−49 = (2×3n−7) × (2×3n+7)
16 8{F} difference-of-squares factorization
9×16n−1 = (3×4n−1) × (3×4n+1)
16 {F}7 difference-of-squares factorization
16n−9 = (4n−3) × (4n+3)
16 {4}1 difference-of-squares factorization
(4×16n−49)/15 = (2×4n−7) × (2×4n+7) / 15
16 B{4}1 difference-of-squares factorization
(169×16n−49)/15 = (13×4n−7) × (13×4n+7) / 15
16 1{5} difference-of-squares factorization
(4×16n−1)/3 = (2×4n−1) × (2×4n+1) / 3
16 8{5} difference-of-squares factorization
(25×16n−1)/3 = (5×4n−1) × (5×4n+1) / 3
16 10{5} difference-of-squares factorization
(49×16n−1)/3 = (7×4n−1) × (7×4n+1) / 3
16 A1{5} difference-of-squares factorization
(484×16n−1)/3 = (22×4n−1) × (22×4n+1) / 3
16 7{3} difference-of-squares factorization
(36×16n−1)/5 = (6×4n−1) × (6×4n+1) / 5
16 3{F}AF difference-of-squares factorization
4×16n−81 = (2×4n−9) × (2×4n+9)
16 30{F}AF difference-of-squares factorization
49×16n−81 = (7×4n−9) × (7×4n+9)
16 3{F}A0F difference-of-squares factorization
4×16n−1521 = (2×4n−39) × (2×4n+39)
16 30{F}A0F difference-of-squares factorization
49×16n−1521 = (7×4n−39) × (7×4n+39)
16 {3}23 difference-of-squares factorization
(16n−81)/5 = (4n−9) × (4n+9) / 5
(in fact, difference-of-4th-powers factorization)
(16n−81)/5 = (2n−3) × (2n+3) × (4n+9) / 5
16 {5}45 difference-of-squares factorization
(16n−49)/3 = (4n−7) × (4n+7) / 3
16 {C}B difference-of-squares factorization
(4×16n−9)/5 = (2×4n−3) × (2×4n+3) / 5
16 {C}D Aurifeuillian factorization of x4+4×y4
(4×16n+1)/5 = (2×4n−2×2n+1) × (2×4n+2×2n+1) / 5
16 {C}DD Aurifeuillian factorization of x4+4×y4
(4×16n+81)/5 = (2×4n−6×2n+9) × (2×4n+6×2n+9) / 5
25 {1} difference-of-squares factorization
(25n−1)/24 = (5n−1) × (5n+1) / 24
25 2{1} difference-of-squares factorization
(49×25n−1)/24 = (7×5n−1) × (7×5n+1) / 24
25 5{1} difference-of-squares factorization
(121×25n−1)/24 = (11×5n−1) × (11×5n+1) / 24
25 7{1} difference-of-squares factorization
(169×25n−1)/24 = (13×5n−1) × (13×5n+1) / 24
25 C{1} difference-of-squares factorization
(289×25n−1)/24 = (17×5n−1) × (17×5n+1) / 24
25 F{1} difference-of-squares factorization
(361×25n−1)/24 = (19×5n−1) × (19×5n+1) / 24
25 M{1} difference-of-squares factorization
(529×25n−1)/24 = (23×5n−1) × (23×5n+1) / 24
25 1F{1} difference-of-squares factorization
(961×25n−1)/24 = (31×5n−1) × (31×5n+1) / 24
25 1{3} difference-of-squares factorization
(9×25n−1)/8 = (3×5n−1) × (3×5n+1) / 8
25 1{8} difference-of-squares factorization
(4×25n−1)/3 = (2×5n−1) × (2×5n+1) / 3
25 5{8} difference-of-squares factorization
(16×25n−1)/3 = (4×5n−1) × (4×5n+1) / 3
25 A{3} difference-of-squares factorization
(81×25n−1)/8 = (9×5n−1) × (9×5n+1) / 8
25 L{8} difference-of-squares factorization
(64×25n−1)/3 = (8×5n−1) × (8×5n+1) / 3
25 {3}2 difference-of-squares factorization
(25n−9)/8 = (5n−3) × (5n+3) / 8
25 {8}3 difference-of-squares factorization
(25n−16)/3 = (5n−4) × (5n+4) / 3
25 {8}7 difference-of-squares factorization
(25n−4)/3 = (5n−2) × (5n+2) / 3
25 {3}2I difference-of-squares factorization
(25n−81)/8 = (5n−9) × (5n+9) / 8
25 {8}5I difference-of-squares factorization
(25n−196)/3 = (5n−14) × (5n+14) / 3
25 {8}7C difference-of-squares factorization
(25n−64)/3 = (5n−8) × (5n+8) / 3
27 8{0}1 sum-of-cubes factorization
8×27n+1 = (2×3n+1) × (4×9n−2×3n+1)
27 1{0}8 sum-of-cubes factorization
27n+8 = (3n+2) × (9n−2×3n+4)
27 {D}E sum-of-cubes factorization
(27n+1)/2 = (3n+1) × (9n−3n+1) / 2
27 7{Q} difference-of-cubes factorization
8×27n−1 = (2×3n−1) × (4×9n+2×3n+1)
27 {Q}J difference-of-cubes factorization
27n−8 = (3n−2) × (9n+2×3n+4)
27 9{G} difference-of-cubes factorization
(125×27n−8)/13 = (5×3n−2) × (25×9n+10×3n+4) / 13
32 1{0}1 sum-of-5th-powers factorization
32n+1 = (2n+1) × (16n−8n+4n−2n+1)
32 {1} difference-of-5th-powers factorization
(32n−1)/31 = (2n−1) × (16n+8n+4n+2n+1) / 31
36 3{7} difference-of-squares factorization
(16×36n−1)/5 = (4×6n−1) × (4×6n+1) / 5
36 3{Z} difference-of-squares factorization
4×36n−1 = (2×6n−1) × (2×6n+1)
36 8{Z} difference-of-squares factorization
9×36n−1 = (3×6n−1) × (3×6n+1)
36 O{Z} difference-of-squares factorization
25×36n−1 = (5×6n−1) × (5×6n+1)
36 {Z}B difference-of-squares factorization
36n−25 = (6n−5) × (6n+5)
36 8{Z}B difference-of-squares factorization
9×36n−25 = (3×6n−5) × (3×6n+5)
36 F{Z}B difference-of-squares factorization
16×36n−25 = (4×6n−5) × (4×6n+5)
36 {Z}RZ difference-of-squares factorization
36n−289 = (6n−17) × (6n+17)
36 F{Z}RZ difference-of-squares factorization
16×36n−289 = (4×6n−17) × (4×6n+17)
36 O{Z}RZ difference-of-squares factorization
25×36n−289 = (5×6n−17) × (5×6n+17)
36 O{5} difference-of-squares factorization
(169×36n−1)/7 = (13×6n−1) × (13×6n+1) / 7
36 O{7} difference-of-squares factorization
(121×36n−1)/5 = (11×6n−1) × (11×6n+1) / 5
36 {9}1 difference-of-squares factorization
(9×36n−289)/35 = (3×6n−17) × (3×6n+17) / 35
36 T{9}1 difference-of-squares factorization
(1024×36n−289)/35 = (32×6n−17) × (32×6n+17) / 35
36 {G}D difference-of-squares factorization
(16×36n−121)/35 = (4×6n−11) × (4×6n+11) / 35
36 {G}8D difference-of-squares factorization
(16×36n−10201)/35 = (4×6n−101) × (4×6n+101) / 35
36 R{G}D difference-of-squares factorization
(961×36n−121)/35 = (31×6n−11) × (31×6n+11) / 35
36 3{G}8D difference-of-squares factorization
(121×36n−10201)/35 = (11×6n−101) × (11×6n+101) / 35
36 R{G}8D difference-of-squares factorization
(961×36n−10201)/35 = (31×6n−101) × (31×6n+101) / 35
36 {K}H difference-of-squares factorization
(4×36n−25)/7 = (2×6n−5) × (2×6n+5) / 7
36 {K}IH difference-of-squares factorization
(4×36n−529)/7 = (2×6n−23) × (2×6n+23) / 7
36 B{K}H difference-of-squares factorization
(81×36n−25)/7 = (9×6n−5) × (9×6n+5) / 7
36 3{K}IH difference-of-squares factorization
(25×36n−529)/7 = (5×6n−23) × (5×6n+23) / 7
36 B{K}IH difference-of-squares factorization
(81×36n−529)/7 = (9×6n−23) × (9×6n+23) / 7
36 {S}J difference-of-squares factorization
(4×36n−49)/5 = (2×6n−7) × (2×6n+7) / 5
36 {S}IJ difference-of-squares factorization
(4×36n−1849)/5 = (2×6n−43) × (2×6n+43) / 5
36 1{S}J difference-of-squares factorization
(9×36n−49)/5 = (3×6n−7) × (3×6n+7) / 5
36 C{S}J difference-of-squares factorization
(64×36n−49)/5 = (8×6n−7) × (8×6n+7) / 5
36 X{S}J difference-of-squares factorization
(169×36n−49)/5 = (13×6n−7) × (13×6n+7) / 5
36 1{S}GJ difference-of-squares factorization
(9×36n−2209)/5 = (3×6n−47) × (3×6n+47) / 5
36 9{S}GJ difference-of-squares factorization
(49×36n−2209)/5 = (7×6n−47) × (7×6n+47) / 5
36 C{S}GJ difference-of-squares factorization
(64×36n−2209)/5 = (8×6n−47) × (8×6n+47) / 5
36 X{S}GJ difference-of-squares factorization
(169×36n−2209)/5 = (13×6n−47) × (13×6n+47) / 5
36 1{S}IJ difference-of-squares factorization
(9×36n−1849)/5 = (3×6n−43) × (3×6n+43) / 5
36 9{S}IJ difference-of-squares factorization
(49×36n−1849)/5 = (7×6n−43) × (7×6n+43) / 5
14 8{D} combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization 9×14n−1 = (3×14n−1) × (3×14n+1)
12 {B}9B combine of factor 13 and difference-of-squares factorization
odd length is divisible by 13, even length has factorization 12n−25 = (12n−5) × (12n+5)
14 {D}5 combine of factor 5 and difference-of-squares factorization
odd length is divisible by 5, even length has factorization 14n−9 = (14n−3) × (14n+3)
17 1{9} combine of factor 2 and difference-of-squares factorization
even length is divisible by 2, odd length has factorization (25×17n−9)/16 = (5×17n−3) × (5×17n+3) / 16
17 7{9} combine of factor 2 and difference-of-squares factorization
even length is divisible by 2, odd length has factorization (121×17n−9)/16 = (11×17n−3) × (11×17n+3) / 16
17 {9}2 combine of factor 2 and difference-of-squares factorization
odd length is divisible by 2, even length has factorization (9×17n−121)/16 = (3×17n−11) × (3×17n+11) / 16
17 {9}8 combine of factor 2 and difference-of-squares factorization
odd length is divisible by 2, even length has factorization (9×17n−25)/16 = (3×17n−5) × (3×17n+5) / 16
19 1{6} combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization (4×19n−1)/3 = (2×19n−1) × (2×19n+1) / 3
19 {6}5 combine of factor 5 and difference-of-squares factorization
odd length is divisible by 5, even length has factorization (19n−4)/3 = (19n−2) × (19n+2) / 3
19 7{2} combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization (64×19n−1)/9 = (8×19n−1) × (8×19n+1) / 9
19 89{6} combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization (484×19n−1)/3 = (22×19n−1) × (22×19n+1) / 3
24 3{N} combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization 4×24n−1 = (2×24n−1) × (2×24n+1)
24 5{N} combine of factor 5 and difference-of-squares factorization
odd length is divisible by 5, even length has factorization 6×24n+1−1 = (12×24n−1) × (12×24n+1)
24 8{N} combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization 9×24n−1 = (3×24n−1) × (3×24n+1)
24 {6}1 combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization (6×24n+1−121)/23 = (12×24n−11) × (12×24n+11) / 23
24 {N}LN combine of factor 5 and difference-of-squares factorization
odd length is divisible by 5, even length has factorization 24n−49 = (24n−7) × (24n+7)
33 F{W} combine of factor 17 and difference-of-squares factorization
even length is divisible by 17, odd length has factorization 16×33n−1 = (4×33n−1) × (4×33n+1)
33 {W}H combine of factor 17 and difference-of-squares factorization
odd length is divisible by 17, even length has factorization 33n−16 = (33n−4) × (33n+4)
33 3{P} combine of factor 2 and difference-of-squares factorization
even length is divisible by 2, odd length has factorization (121×33n−25)/32 = (11×33n−5) × (11×33n+5) / 32
33 D{P} combine of factor 2 and difference-of-squares factorization
even length is divisible by 2, odd length has factorization (441×33n−25)/32 = (21×33n−5) × (21×33n+5) / 32
34 1{B} combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization (4×34n−1)/3 = (2×34n−1) × (2×34n+1) / 3
34 8{X} combine of factor 5 and difference-of-squares factorization
even length is divisible by 5, odd length has factorization 9×34n−1 = (3×34n−1) × (3×34n+1)
34 {X}P combine of factor 5 and difference-of-squares factorization
odd length is divisible by 5, even length has factorization 34n−9 = (34n−3) × (34n+3)

Also families which contain only one very small prime > b:

b family why this family contains only one prime > b
27 2{0}J always divisible by some element of {5,7,73}
but 2J is prime, and 2J is the only prime > b in this family
divisible by 7 if the length is odd, divisible by 5 if the length is == 0 mod 4, divisible by 73 if the length is == 2 mod 4
4 {1} difference-of-squares factorization
but 11 is prime, and 11 is the only prime > b in this family
(4n−1)/3 = (2n−1) × (2n+1) / 3
8 {1} difference-of-cubes factorization
but 111 is prime, and 111 is the only prime > b in this family
(8n−1)/7 = (2n−1) × (4n+2n+1) / 7
16 {1} difference-of-squares factorization
but 11 is prime, and 11 is the only prime > b in this family
(16n−1)/15 = (4n−1) × (4n+1) / 15
27 {1} difference-of-cubes factorization
but 111 is prime, and 111 is the only prime > b in this family
(27n−1)/26 = (3n−1) × (9n+3n+1) / 26
27 {G}7 difference-of-cubes factorization
but G7 is prime, and G7 is the only prime > b in this family
(8×27n−125)/13 = (2×3n−5) × (4×9n+10×3n+25) / 13
36 {1} difference-of-squares factorization
but 11 is prime, and 11 is the only prime > b in this family
(36n−1)/35 = (6n−1) × (6n+1) / 35

Some x{y}z (where x and z are strings (may be empty) of digits in base b, y is a digit in base b) families could not be proven to contain no primes > b (by covering congruence, algebraic factorization, or combine of them) but no primes > b could be found in the family, even after searching through numbers with over 50000 digits. In such a case, the only way to proceed is to test the primality of larger and larger numbers of such form and hope a prime is eventually discovered.

Many x{y}z (where x and z are strings (may be empty) of digits in base b, y is a digit in base b) families contain no small primes > b even though they do contain very large primes. e.g. the smallest prime in the base 23 family 9{E} is 9E800873 which when written in decimal contains 1090573 digits (technically, probable primality tests were used to show this (which have a very small chance of making an error (https://primes.utm.edu/notes/prp_prob.html, https://www.ams.org/journals/mcom/1989-53-188/S0025-5718-1989-0982368-4/S0025-5718-1989-0982368-4.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_22.pdf))) because all known primality tests (https://en.wikipedia.org/wiki/Primality_test, https://www.rieselprime.de/ziki/Primality_test, https://mathworld.wolfram.com/PrimalityTest.html) run far too slowly to run on a number of this size unless either N−1 (https://primes.utm.edu/prove/prove3_1.html) or N+1 (https://primes.utm.edu/prove/prove3_2.html) (or both) (unfortunely, none of Wikipedia, Prime Wiki, Mathworld has article for N−1 primality test or N+1 primality test, but a similar article for Pocklington primality test: https://en.wikipedia.org/wiki/Pocklington_primality_test, https://www.rieselprime.de/ziki/Pocklington%27s_theorem, https://mathworld.wolfram.com/PocklingtonsTheorem.html, also see the article for the cyclotomy primality test: https://primes.utm.edu/glossary/xpage/Cyclotomy.html) can be ≥ 1/4 factored (https://en.wikipedia.org/wiki/Integer_factorization, https://www.rieselprime.de/ziki/Factorization, https://mathworld.wolfram.com/PrimeFactorizationAlgorithms.html), see the article http://www.ams.org/journals/mcom/1975-29-130/S0025-5718-1975-0384673-1/S0025-5718-1975-0384673-1.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_23.pdf) for the case that either N−1 or N+1 (or both) can be ≥ 1/3 factored, if either N−1 or N+1 (or both) can be ≥ 1/4 factored but neither can be ≥ 1/3 factored, then we need to use CHG (https://mersenneforum.org/attachment.php?attachmentid=21133&d=1571237465, https://primes.utm.edu/bios/page.php?id=797, https://github.com/xayahrainie4793/prime-programs-cached-copy/tree/main/CHG) to prove its primality (see https://mersenneforum.org/showpost.php?p=528149&postcount=3), for the examples of the numbers which are proven prime by CHG, see https://primes.utm.edu/primes/page.php?id=126454, https://primes.utm.edu/primes/page.php?id=131964, https://primes.utm.edu/primes/page.php?id=123456, https://primes.utm.edu/primes/page.php?id=130933, https://stdkmd.net/nrr/cert/1/ (search for "CHG"), https://stdkmd.net/nrr/cert/2/ (search for "CHG"), https://stdkmd.net/nrr/cert/3/ (search for "CHG"), https://stdkmd.net/nrr/cert/4/ (search for "CHG"), https://stdkmd.net/nrr/cert/5/ (search for "CHG"), https://stdkmd.net/nrr/cert/6/ (search for "CHG"), https://stdkmd.net/nrr/cert/7/ (search for "CHG"), https://stdkmd.net/nrr/cert/8/ (search for "CHG"), https://stdkmd.net/nrr/cert/9/ (search for "CHG"), however, factordb (http://factordb.com/) lacks the ability to verify CHG proofs, see https://mersenneforum.org/showpost.php?p=608362&postcount=165)

The numbers in x{y}z (where x and z are strings (may be empty) of digits in base b, y is a digit in base b) families are of the form (a×bn+c)/gcd(a+c,b−1) for some fixed a, b, c such that a ≥ 1, b ≥ 2 (b is the base), c ≠ 0, gcd(a,c) = 1, gcd(b,c) = 1. Except in the special case c = ±1 and gcd(a+c,b−1) = 1, when n is large the known primality tests for such a number are too inefficient to run. In this case one must resort to a probable primality test such as a Miller–Rabin primality test (https://en.wikipedia.org/wiki/Miller%E2%80%93Rabin_primality_test, https://primes.utm.edu/glossary/xpage/MillersTest.html, https://www.rieselprime.de/ziki/Miller-Rabin_pseudoprimality_test, https://mathworld.wolfram.com/Rabin-MillerStrongPseudoprimeTest.html) or a Baillie–PSW primality test (https://en.wikipedia.org/wiki/Baillie%E2%80%93PSW_primality_test, https://mathworld.wolfram.com/Baillie-PSWPrimalityTest.html), unless a divisor of the number can be found. Since we are testing many numbers in an exponential sequence, it is possible to use a sieving process (https://www.rieselprime.de/ziki/Sieving, https://mathworld.wolfram.com/Sieve.html) to find divisors rather than using trial division (https://en.wikipedia.org/wiki/Trial_division, https://primes.utm.edu/glossary/xpage/TrialDivision.html, https://www.rieselprime.de/ziki/Trial_factoring, https://mathworld.wolfram.com/TrialDivision.html).

To do this, we made use of Geoffrey Reynolds’ SRSIEVE software (https://www.bc-team.org/app.php/dlext/?cat=3, https://mersenneforum.org/attachment.php?attachmentid=16377&d=1499103807, https://archive.vn/XrJkw, http://www.rieselprime.de/dl/CRUS_pack.zip, https://primes.utm.edu/bios/page.php?id=905, https://www.rieselprime.de/ziki/Srsieve, https://github.com/xayahrainie4793/prime-programs-cached-copy/tree/main/srsieve_1.1.4, https://github.com/xayahrainie4793/prime-programs-cached-copy/tree/main/sr1sieve_1.4.6, https://github.com/xayahrainie4793/prime-programs-cached-copy/tree/main/sr2sieve_2.0.0, https://github.com/xayahrainie4793/prime-programs-cached-copy/tree/main/srbsieve). This program uses the baby-step giant-step algorithm to find all primes p which divide a×bn+c where p and n lie in a specified range (also, this program was updated so that it also removes the n such that a×bn+c has algebraic factors (e.g. difference-of-squares factorization, sum/difference-of-cubes factorization, Aurifeuillian factorization (https://en.wikipedia.org/wiki/Aurifeuillean_factorization, https://www.rieselprime.de/ziki/Aurifeuillian_factor, https://mathworld.wolfram.com/AurifeuilleanFactorization.html) of x4+4×y4), see https://mersenneforum.org/showpost.php?p=452132&postcount=66 and https://mersenneforum.org/showthread.php?t=21916). Since this program cannot handle the general case (a×bn+c)/gcd(a+c,b−1) when gcd(a+c,b−1) > 1 we only used it to sieve the sequence a×bn+c for primes p not dividing gcd(a+c,b−1), and initialized the list of candidates to not include n for which there is some prime p dividing gcd(a+c,b−1) for which p dividing (a×bn+c)/gcd(a+c,b−1). The program had to be modified slightly to remove a check which would prevent it from running in the case when a, b, and c were all odd (since then 2 divides a×bn+c, but 2 may not divide (a×bn+c)/gcd(a+c,b−1)) (see https://github.com/curtisbright/mepn-data/commit/1b55b353f46c707bbe52897573914128b3303960).

Once the numbers with small divisors had been removed, it remained to test the remaining numbers using a probable primality test. For this we used the software LLR by Jean Penn´e (http://jpenne.free.fr/index2.html, https://primes.utm.edu/bios/page.php?id=431, https://www.rieselprime.de/ziki/LLR, https://github.com/xayahrainie4793/prime-programs-cached-copy/tree/main/llr403win64) or PFGW (https://sourceforge.net/projects/openpfgw/, https://primes.utm.edu/bios/page.php?id=175, https://www.rieselprime.de/ziki/PFGW, https://github.com/xayahrainie4793/prime-programs-cached-copy/tree/main/pfgw_win_4.0.3). Although undocumented, it is possible to run these two programs on numbers of the form (a×bn+c)/gcd(a+c,b−1) when gcd(a+c,b−1) > 1, so this program required no modifications. A script was also written which allowed one to run srsieve while LLR or PFGW was testing the remaining candidates, so that when a divisor was found by srsieve on a number which had not yet been tested by LLR or PFGW it would be removed from the list of candidates.

For the primes < 1025000 for the solved or near-solved bases (bases b with ≤ 3 unsolved families, i.e. bases b = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 28, 30), we employed PRIMO by Marcel Martin (http://www.ellipsa.eu/public/primo/primo.html, http://www.rieselprime.de/dl/Primo309.zip, https://primes.utm.edu/bios/page.php?id=46, https://www.rieselprime.de/ziki/Primo, https://github.com/xayahrainie4793/prime-programs-cached-copy/tree/main/primo-433-lx64), an elliptic curve primality proving (https://primes.utm.edu/prove/prove4_2.html, https://en.wikipedia.org/wiki/Elliptic_curve_primality, https://primes.utm.edu/glossary/xpage/ECPP.html, https://mathworld.wolfram.com/EllipticCurvePrimalityProving.html) implementation.

We have completely solved this problem for bases b = 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 18, 20, 24 (thus, currently we can complete the classification of the minimal primes in these bases), also we have completely solved this problem for bases b = 11, 16, 22, 30 if we allow probable primes (https://en.wikipedia.org/wiki/Probable_prime, https://primes.utm.edu/glossary/xpage/PRP.html, https://www.rieselprime.de/ziki/Probable_prime, https://mathworld.wolfram.com/ProbablePrime.html) > 1025000 in place of proven primes, besides, we have completely solved this problem for bases b = 13, 17, 19, 21, 23, 26, 28, 36 (if we allow strong probable primes in place of proven primes) except the families x{y}z (where x and z are strings (may be empty) of digits in base b, y is a digit in base b) listed in the "left b" files (see the condensed table below for the searching limit of these families).

We are unable to determine if the families x{y}z (where x and z are strings (may be empty) of digits in base b, y is a digit in base b) listed in the "left b" files (see the condensed table below for the searching limit of these families) contain a prime (only count the numbers > b) or not (even if we allow probable primes), i.e. these families have no known prime (or probable prime) members > b, nor can they be ruled out as only containing composites (only count the numbers > b) (by covering congruence, algebraic factorization, or combine of them), and all of these families are expected to contain a prime > b (in fact, expected to contain infinitely many primes), since there is a heuristic argument (https://en.wikipedia.org/wiki/Heuristic_argument, https://primes.utm.edu/glossary/xpage/Heuristic.html, https://mathworld.wolfram.com/Heuristic.html) that all families which cannot be ruled out as only containing composites or only containing finitely many primes (by covering congruence, algebraic factorization, or combine of them) contain infinitely many primes, since by the prime number theorem (https://en.wikipedia.org/wiki/Prime_number_theorem, https://primes.utm.edu/glossary/xpage/PrimeNumberThm.html, https://mathworld.wolfram.com/PrimeNumberTheorem.html) the chance (https://en.wikipedia.org/wiki/Probability, https://mathworld.wolfram.com/Probability.html) that a random (https://en.wikipedia.org/wiki/Random_number, https://mathworld.wolfram.com/RandomNumber.html) n-digit base b number is prime is approximately (https://en.wikipedia.org/wiki/Asymptotic_analysis, https://primes.utm.edu/glossary/xpage/AsymptoticallyEqual.html, https://mathworld.wolfram.com/Asymptotic.html) 1/n (more accurately, the chance is approximately 1/(n×ln(b)), where ln is the natural logarithm (https://en.wikipedia.org/wiki/Natural_logarithm, https://primes.utm.edu/glossary/xpage/Log.html, https://mathworld.wolfram.com/NaturalLogarithm.html). If one conjectures the numbers x{y}z behave similarly you would expect 1/1 + 1/2 + 1/3 + 1/4 + ... = ∞ (https://en.wikipedia.org/wiki/Harmonic_series_(mathematics), https://mathworld.wolfram.com/HarmonicSeries.html) primes of the form x{y}z (of course, this does not always happen, since some x{y}z families can be ruled out as only containing composites (only count the numbers > b) (by covering congruence, algebraic factorization, or combine of them), but it is at least a reasonable conjecture in the absence of evidence to the contrary).

For base 19, the smallest prime in family 5{H}05 may or may not be minimal prime, since another unsolved family is 5{H}5, and the smallest prime in family FHHH0{H} may or may not be minimal prime, since another unsolved family is FH0{H}.

For base 21, the smallest prime in families F{9}D may or may not be minimal primes, since another unsolved family is {9}D.

There are also unproven probable primes (however, in this project our results assume that they are in fact primes, since they are > 1025000 and the probability that they are in fact composite is < 10−2000, see https://primes.utm.edu/notes/prp_prob.html), the unproven probable primes for bases b = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 28, 30 are:

b index of this minimal prime in base b (assuming the primality of all probable primes in base b) base-b form of the unproven probable prime algebraic ((a×bn+c)/gcd(a+c,b−1)) form of the unproven probable prime
11 1068 5762668
13 3194 C523755C
13 3195 8032017111
13 3196 95197420
16 2345 DB32234
16 2346 472785DD
16 2347 3116137AF
22 8003 BK220015
28 25526 N624051LR
28 25527 5OA31238F
28 25528 O4O945359
30 2618 I024608D

All these numbers are strong probable primes (https://en.wikipedia.org/wiki/Strong_pseudoprime, https://primes.utm.edu/glossary/xpage/StrongPRP.html, https://mathworld.wolfram.com/StrongPseudoprime.html) to bases 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61 (see https://oeis.org/A014233), and strong Lucas probable primes (https://en.wikipedia.org/wiki/Lucas_pseudoprime#Strong_Lucas_pseudoprimes, https://mathworld.wolfram.com/StrongLucasPseudoprime.html) with parameters (P, Q) defined by Selfridge's Method A (see https://oeis.org/A217255), and trial factored to 1016 (thus, all these numbers are Baillie–PSW probable primes.

Primality certificates (https://en.wikipedia.org/wiki/Primality_certificate, https://primes.utm.edu/glossary/xpage/Certificate.html, https://mathworld.wolfram.com/PrimalityCertificate.html) for large proven primes (> 10300) for bases b = 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 18, 20, 22, 24, 28, 30:

b index of this minimal prime in base b base-b form of the minimal prime algebraic ((a×bn+c)/gcd(a+c,b−1)) form of the minimal prime primality certificate for the minimal prime
9 149 763292 (31×9330−19)/4 http://factordb.com/cert.php?id=1100000002359003642
9 150 2768607 (23×9688−511)/8 http://factordb.com/cert.php?id=1100000002495467486
9 151 30115811 3×91160+10 http://factordb.com/cert.php?id=1100000002376318423
11 1065 A71358 11715−58 http://factordb.com/cert.php?id=1100000003576826487
11 1066 775944 (7×11761−367)/10 http://factordb.com/cert.php?id=1100000002505568840
11 1067 5571011 (607×111011−7)/10 http://factordb.com/cert.php?id=1100000002361376522
13 3165 5027044 5×13272+56 http://factordb.com/cert.php?id=1100000002632397005
13 3166 9271095 (3×13274−6103)/4 http://factordb.com/cert.php?id=1100000003590431654
13 3167 102867771 13290+16654 http://factordb.com/cert.php?id=1100000003590431633
13 3168 93081 (3×13309−35)/4 proven prime by N−1 test (https://primes.utm.edu/prove/prove3_1.html), since N−1 is 39/4×(13308−1), thus factor N−1 is equivalent to factor 13308−1, and for the factorization of 13308−1, see http://myfactorcollection.mooo.com:8090/cgi-bin/showSingleEntry?Base=13&Exp=308&c0=-&EN=
13 3169 B341C4 (11×13343+61)/12 http://factordb.com/cert.php?id=1100000003590431618
13 3170 8B343 (107×13343−11)/12 http://factordb.com/cert.php?id=1100000002321018736
13 3171 710371111 92×13374+183 http://factordb.com/cert.php?id=1100000003590431609
13 3172 753757 (89×13376+19)/12 http://factordb.com/cert.php?id=1100000003590431596
13 3173 9B03919 128×13392+9 http://factordb.com/cert.php?id=1100000002632396790
13 3174 7B0B397 (15923×13397−11)/12 http://factordb.com/cert.php?id=1100000003590431574
13 3175 1041493 13416+120 http://factordb.com/cert.php?id=1100000002523249240
13 3176 810104151 17746×13416+1 proven prime by N−1 test (https://primes.utm.edu/prove/prove3_1.html), since N−1 is trivially fully factored
13 3177 81104351 1366×13436+1 proven prime by N−1 test (https://primes.utm.edu/prove/prove3_1.html), since N−1 is trivially fully factored
13 3178 B7486 (139×13486−7)/12 http://factordb.com/cert.php?id=1100000002321015892
13 3179 B563C (11×13564+1)/12 proven prime by N−1 test (https://primes.utm.edu/prove/prove3_1.html), since N−1 is 11/12×(13564−1), thus factor N−1 is equivalent to factor 13564−1, and for the factorization of 13564−1, see http://myfactorcollection.mooo.com:8090/cgi-bin/showSingleEntry?Base=13&Exp=564&c0=-&EN=
13 3180 1B576 (23×13576−11)/12 proven prime by N−1 test (https://primes.utm.edu/prove/prove3_1.html), since N−1 is 23/12×(13576−1), thus factor N−1 is equivalent to factor 13576−1, and for the factorization of 13576−1, see http://myfactorcollection.mooo.com:8090/cgi-bin/showSingleEntry?Base=13&Exp=576&c0=-&EN=
13 3181 8069387 8×13695+111 http://factordb.com/cert.php?id=1100000002615636527
13 3182 CC5713 (2021×13713−5)/12 http://factordb.com/cert.php?id=1100000002615627353
13 3183 B83474 (11×13836−719)/12 http://factordb.com/cert.php?id=1100000003590430871
13 3184 9968B (3×13969+5)/4 http://factordb.com/cert.php?id=1100000000258566244
13 3185 101295181 131298+274 http://factordb.com/cert.php?id=1100000002615445013
13 3186 913625 (3×131363−19)/4 http://factordb.com/cert.php?id=1100000002321017776
13 3187 715041 (7×131505−79)/12 http://factordb.com/cert.php?id=1100000002320890755
13 3188 93015511 120×131552+1 proven prime by N−1 test (https://primes.utm.edu/prove/prove3_1.html), since N−1 is trivially fully factored
13 3189 72022972 93×132298+2 http://factordb.com/cert.php?id=1100000002632396910
13 3190 1770270317 267×132705+20 http://factordb.com/cert.php?id=1100000003590430825
13 3191 39062661 48×136267+1 proven prime by N−1 test (https://primes.utm.edu/prove/prove3_1.html), since N−1 is trivially fully factored
13 3192 B06540BBA 11×136543+2012 http://factordb.com/cert.php?id=1100000002616382906
13 3193 C1063192 1310633−50 http://factordb.com/cert.php?id=1100000003590493750
14 649 34D708 47×14708−1 proven prime by N+1 test (https://primes.utm.edu/prove/prove3_2.html), since N+1 is trivially fully factored
14 650 4D19698 5×1419698−1 proven prime by N+1 test (https://primes.utm.edu/prove/prove3_2.html), since N+1 is trivially fully factored
16 2329 D4263D (199×16264+131)/15 http://factordb.com/cert.php?id=1100000002468170238
16 2330 E02614DD 14×16264+1245 http://factordb.com/cert.php?id=1100000003588388352
16 2331 8C0290ED 140×16292+237 http://factordb.com/cert.php?id=1100000003588388307
16 2332 DA3055 (41×16306−17)/3 http://factordb.com/cert.php?id=1100000003588388284
16 2333 CE80422D 3304×16423+13 http://factordb.com/cert.php?id=1100000003588388257
16 2334 5F5446F 6×16546−145 http://factordb.com/cert.php?id=1100000002604723967
16 2335 88F545 137×16545−1 proven prime by N+1 test (https://primes.utm.edu/prove/prove3_2.html), since N+1 is trivially fully factored
16 2336 BE0792BB 190×16794+187 http://factordb.com/cert.php?id=1100000003588387938
16 2337 D91052 (68×161052−3)/5 http://factordb.com/cert.php?id=1100000002321036020
16 2338 FAF106245 251×161064−187 http://factordb.com/cert.php?id=1100000003588387610
16 2339 F81517F (233×161518+97)/15 http://factordb.com/cert.php?id=1100000000633744824
16 2340 201713321 2×161716+801 http://factordb.com/cert.php?id=1100000003588386735
16 2341 300F1960AF 769×161962−81 http://factordb.com/cert.php?id=1100000003588368750
16 2342 90354291 9×163544+145 http://factordb.com/cert.php?id=1100000000633424191
16 2343 5BC3700D (459×163701+1)/5 http://factordb.com/cert.php?id=1100000000993764322
16 2344 D0B17804 (3131×1617804−11)/15 http://factordb.com/cert.php?id=1100000003589278511
18 547 80298B 8×18299+11 http://factordb.com/cert.php?id=1100000002355574745
18 548 H766FH 18768−37 http://factordb.com/cert.php?id=1100000003590430490
18 549 C06268C5 12×186270+221 http://factordb.com/cert.php?id=1100000003590442437
20 3301 H247A0H (17×20250−59677)/19 http://factordb.com/cert.php?id=1100000003590502619
20 3302 7249A7 (7×20251+1133)/19 http://factordb.com/cert.php?id=1100000003590502602
20 3303 J7270 (368×20270−7)/19 http://factordb.com/cert.php?id=1100000002325395462
20 3304 J330CCC7 20334−58953 http://factordb.com/cert.php?id=1100000003590502572
20 3305 40387404B 4×20391+32091 http://factordb.com/cert.php?id=1100000003590502563
20 3306 EC04297 292×20430+7 http://factordb.com/cert.php?id=1100000002633348702
20 3307 G44799 (16×20449−2809)/19 http://factordb.com/cert.php?id=1100000000840126753
20 3308 3A5273 (67×20528−143)/19 http://factordb.com/cert.php?id=1100000003590502531
20 3309 E566C7 (14×20568−907)/19 http://factordb.com/cert.php?id=1100000003590502516
20 3310 JCJ629 393×20629−1 proven prime by N+1 test (https://primes.utm.edu/prove/prove3_2.html), since N+1 is trivially fully factored
20 3311 J65505J 20658−7881 http://factordb.com/cert.php?id=1100000003590502490
20 3312 501163AJ 5×201165+219 http://factordb.com/cert.php?id=1100000003590502412
20 3313 CD2449 (241×202449−13)/19 http://factordb.com/cert.php?id=1100000002325393915
20 3314 G06269D 16×206270+13 http://factordb.com/cert.php?id=1100000003590539457
22 7984 I7G0254H 8882×22255+17 http://factordb.com/cert.php?id=1100000003591372788
22 7985 D02555EEF 13×22259+60339 http://factordb.com/cert.php?id=1100000003591371932
22 7986 IK322F (398×22323−125)/21 http://factordb.com/cert.php?id=1100000000840384145
22 7987 C0340G9 12×22342+361 http://factordb.com/cert.php?id=1100000000840384159
22 7988 77E348K7 (485×22350+373)/3 http://factordb.com/cert.php?id=1100000003591369779
22 7989 J379KJ (19×22381+443)/21 http://factordb.com/cert.php?id=1100000003591369027
22 7990 J388EJ (19×22390−2329)/21 http://factordb.com/cert.php?id=1100000003591367729
22 7991 DJ400 (292×22400−19)/21 http://factordb.com/cert.php?id=1100000002325880110
22 7992 E404K7 (2×22406+373)/3 http://factordb.com/cert.php?id=1100000003591366298
22 7993 66F453B3 (971×22455−705)/7 http://factordb.com/cert.php?id=1100000003591365809
22 7994 L0454B63 21×22457+5459 http://factordb.com/cert.php?id=1100000003591365331
22 7995 L483G3 22485−129 http://factordb.com/cert.php?id=1100000003591364730
22 7996 E60496L 314×22497+21 http://factordb.com/cert.php?id=1100000000632703239
22 7997 I626AF (6×22628−1259)/7 http://factordb.com/cert.php?id=1100000000632724334
22 7998 K0760EC1 20×22763+7041 http://factordb.com/cert.php?id=1100000000632724415
22 7999 J0767IGGJ 19×22771+199779 http://factordb.com/cert.php?id=1100000003591362567
22 8000 7959K7 (22961+857)/3 http://factordb.com/cert.php?id=1100000003591361817
22 8001 L2385KE7 222388−653 http://factordb.com/cert.php?id=1100000003591360774
22 8002 738152L (223817−289)/3 http://factordb.com/cert.php?id=1100000003591359839
24 3400 I0241I5 18×24243+437 http://factordb.com/cert.php?id=1100000002633360037
24 3401 D0259KKD 13×24262+12013 http://factordb.com/cert.php?id=1100000003593270725
24 3402 C7298 (283×24298−7)/23 http://factordb.com/cert.php?id=1100000002326181235
24 3403 203137 2×24314+7 http://factordb.com/cert.php?id=1100000002355610241
24 3404 BC0331B 276×24332+11 http://factordb.com/cert.php?id=1100000002633359842
24 3405 N2644LLN 242647−1201 http://factordb.com/cert.php?id=1100000003593270089
24 3406 D2698LD (13×242700+4403)/23 http://factordb.com/cert.php?id=1100000003593269876
24 3407 A029518ID 10×242954+5053 http://factordb.com/cert.php?id=1100000003593269654
24 3408 88N5951 201×245951−1 proven prime by N+1 test (https://primes.utm.edu/prove/prove3_2.html), since N+1 is trivially fully factored
24 3409 N00N8129LN 13249×248131−49 http://factordb.com/cert.php?id=1100000003593391606
28 25486 3211M9 (28213+4841)/9 http://factordb.com/cert.php?id=1100000003850161936
28 25487 HD0213D 489×28214+13 http://factordb.com/cert.php?id=1100000003850161937
28 25488 64O2179 (1556×28218−143)/9 http://factordb.com/cert.php?id=1100000000840840215
28 25489 G0217A0N 16×28220+7863 http://factordb.com/cert.php?id=1100000003850161938
28 25490 55OA226F (110278×28227+125)/27 http://factordb.com/cert.php?id=1100000003850161939
28 25491 L0229Q3 21×28231+731 http://factordb.com/cert.php?id=1100000003850161940
28 25492 B02317ID 11×28234+6005 http://factordb.com/cert.php?id=1100000003850161941
28 25493 PM233B (697×28234−319)/27 http://factordb.com/cert.php?id=1100000003850161942
28 25494 K0238OF 20×28240+687 http://factordb.com/cert.php?id=1100000000840840142
28 25495 I262E3 (2×28264−383)/3 http://factordb.com/cert.php?id=1100000003850161943
28 25496 C5A273F (9217×28274+125)/27 http://factordb.com/cert.php?id=1100000003850161944
28 25497 J0276IMB 19×28279+14739 http://factordb.com/cert.php?id=1100000003850161945
28 25498 F0282QAP 15×28285+20689 http://factordb.com/cert.php?id=1100000000840840006
28 25499 M0296KKN 22×28299+16263 http://factordb.com/cert.php?id=1100000003850161946
28 25500 C31043 (4×28312−2101)/9 http://factordb.com/cert.php?id=1100000003850161947
28 25513 70748M5 7×28750+621 http://factordb.com/cert.php?id=1100000003850161956
28 25514 4A0804B 122×28805+11 http://factordb.com/cert.php?id=1100000003850161957
28 25515 LK925F (587×28926−155)/27 http://factordb.com/cert.php?id=1100000000840839978
28 25516 J01071AC5 19×281074+8181 http://factordb.com/cert.php?id=1100000003850161959
28 25517 J01252J5 19×281254+537 http://factordb.com/cert.php?id=1100000003850161963
28 25518 513046F (5×281306+1021)/27 http://factordb.com/cert.php?id=1100000003850161964
28 25519 51332P8P (5×281335+426163)/27 http://factordb.com/cert.php?id=1100000003850161965
28 25520 5I1370F (17×281371−11)/3 http://factordb.com/cert.php?id=1100000003850161972
28 25521 A14236F (10×281425−2899)/27 http://factordb.com/cert.php?id=1100000000840839947
28 25522 G01899AN 16×281901+303 http://factordb.com/cert.php?id=1100000003850161973
28 25523 537468P (5×283748+2803)/27 http://factordb.com/cert.php?id=1100000003850161974
28 25524 QO423969 (242×284241−4679)/9 http://factordb.com/cert.php?id=1100000000840839934
28 25525 D0526777D 13×285270+5697 http://factordb.com/cert.php?id=1100000003850151420
30 2613 AN206 (313×30206−23)/29 http://factordb.com/cert.php?id=1100000002327651073
30 2614 M241QB (22×30243+3139)/29 http://factordb.com/cert.php?id=1100000003593408295
30 2615 M0547SS7 22×30550+26047 http://factordb.com/cert.php?id=1100000003593407988
30 2616 C010221 12×301023+1 proven prime by N−1 test (https://primes.utm.edu/prove/prove3_1.html), since N−1 is trivially fully factored
30 2617 54882J (5×304883+401)/29 http://factordb.com/cert.php?id=1100000002327649423
30 2619 OT34205 25×3034205−1 proven prime by N+1 test (https://primes.utm.edu/prove/prove3_2.html), since N+1 is trivially fully factored

Condensed table for bases 2 ≤ b ≤ 36: (the bases b = 11, 13, 16, 17, 19, 21~23, 25~36 data assumes the primality of the probable primes) (This data assumes that a number > 1025000 which has passed the Miller–Rabin primality tests to all prime bases p < 64 and has passed the Baillie–PSW primality test and has trial factored to 264 is in fact prime, since in some cases (e.g. b = 11) a candidate for minimal prime base b is too large to be proven prime rigorously)

b number of minimal primes base b base-b form of the top 10 known minimal prime base b (write "dn" if there are 5 or more (n) consecutive same digits d) length of the top 10 known minimal prime base b algebraic ((a×bn+c)/gcd(a+c,b−1)) form of the top 10 known minimal prime base b number of unsolved families in base b searching limit of length for the unsolved families in base b (if there are different searching limits for the unsolved families in base b, choose the lowest searching limit)
2 1 11 2 3 0
3 3 111
21
12
3
2
2
13
7
5
0
4 5 221
31
23
13
11
3
2
2
2
2
41
13
11
7
5
0
5 22 109313
300031
44441
33331
33001
30301
14444
10103
3101
414
96
6
5
5
5
5
5
5
4
3
595+8
9391
3121
2341
2251
1951
1249
653
401
109
0
6 11 40041
4441
4401
51
45
35
31
25
21
15
5
4
4
2
2
2
2
2
2
2
5209
1033
1009
31
29
23
19
17
13
11
0
7 71 3161
51071
3601
1100021
531101
351101
300053
150001
100121
40054
17
10
8
7
6
6
6
6
6
5
(717−5)/2
36×78+1
(78−47)/2
134471
91631
62819
50459
28813
16871
9643
0
8 75 42207
51325
7121
7777461
7471
481
55025
5550525
5500525
4577
221
15
13
11
9
9
8
7
7
7
(4×8221+17)/7
(5×815−173)/7
813−7
(28669×87−25)/7
(53×88−25)/7
(4×89−25)/7
(5×88−2413)/7
1495381
1474901
(4×87+185)/7
0
9 151 30115811
2768607
763292
56136
102557
302051
819335
7271507
511361
1012507
1161
689
331
38
28
23
22
19
16
15
3×91160+10
(23×9688−511)/8
(31×9330−19)/4
(409×936−1)/8
927+52
3×922+46
922−454
(527×917−511)/8
(41×915+359)/8
914+412
0
10 77 502827
5111
80551
66600049
66000049
60549
22051
5200007
946669
666649
31
12
8
8
8
8
8
7
6
6
5×1030+27
(5×1012−41)/9
(725×106−41)/9
66600049
66000049
6×107+49
22×106+1
5200007
946669
666649
0
11 1068 5762668
5571011
775944
A71358
8522005
507206
51612A
5012657
1012551
326122
62669
1013
761
715
223
208
163
129
128
124
(57×1162668−7)/10
(607×111011−7)/10
(7×11761−367)/10
11715−58
(17×11222−111)/2
(557×11206−7)/10
(11163−57)/2
5×11128+62
11127+56
(178×11122−3)/5
0
12 106 403977
B0279B
B699B
AA051
B00099B
AAA0001
BBBAA1
A00065
44AAA1
BBBB1
42
30
9
8
7
7
6
6
6
5
4×1241+91
11×1229+119
129−313
130×126+1
32847239
32555521
2985817
2488397
1097113
248821
0
13 3196~3197 95197420
8032017111
C523755C
C1063192
B06540BBA
39062661
1770270317
72022972
93015511
715041
197421
32021
23757
10633
6544
6269
2708
2300
1554
1505
(113×13197420−5)/12
8×1332020+183
(149×1323756+79)/12
1310633−50
11×136543+2012
48×136267+1
267×132705+20
93×132298+2
120×131552+1
(7×131505−79)/12
1 300000
14 650 4D19698
34D708
8D14185
886B
408349
8C793
1879B
6B772B
46309
A593
19699
710
144
87
86
81
81
80
65
60
5×1419698−1
47×14708−1
9×14143−79
(8×1487+31)/13
4×1485+65
(116×1480−129)/13
(21×1480+31)/13
(89×1479−1649)/13
(4×1465−667)/13
(10×1460−101)/13
0
15 1284 715597
E145397
9610408
773CE
759CCE
503317
EB31
6330261
705024B
B70241
157
148
107
75
62
36
32
30
28
27
(15157+59)/2
15148−2558
(66×15106−619)/7
(1575+163)/2
(1562+2413)/2
5×1535+22
(207×1531−11)/14
1398×1527+1
1580×1525+11
172×1525+1
0
16 2347 3116137AF
472785DD
DB32234
D0B17804
5BC3700D
90354291
300F1960AF
201713321
F81517F
FAF106245
116139
72787
32235
17806
3703
3545
1965
1717
1519
1066
(16116139+619)/5
(4×1672787+2291)/15
(206×1632234−11)/15
(3131×1617804−11)/15
(459×163701+1)/5
9×163544+145
769×161962−81
2×161716+801
(233×161518+97)/15
251×161064−187
0
17 10409~10427 B671032E
570513101
E9B44732
D0GD37096
G732072F
15024325D
34716074
B3013077D
9D0103985
1090191F
67105
51313
44734
37099
32074
24328
16076
13080
10401
9022
(11×1767105−2411)/16
92×1751311+1
(3963×1744732−11)/16
(60381×1737096−13)/16
(263×1732073+121)/16
22×1724326+13
(887×1716074−7)/16
190×1713078+13
166×1710399+5
179021+32
18 100000
18 549 C06268C5
H766FH
80298B
C0116F5
HD93
GG0301
CF305
B196B
CCF145
714G7
6271
768
300
119
94
33
32
21
17
16
12×186270+221
18768−37
8×18299+11
12×18118+275
(302×1893−13)/17
304×1831+1
(219×1831−185)/17
(11×1821−1541)/17
(3891×1815−185)/17
(7×1816+2747)/17
0
19 31411~31435 D90730469
4F0498476
2482247
2458867A
9042994G
DB36272
333531088
B26588FG
10227907717
C722667C
73049
49850
48225
45888
42996
36273
31091
26590
22795
22669
256×1973047+9
91×1949848+6
(1948225+44)/9
(1945888+926)/9
9×1942995+16
(245×1936272−11)/18
(20579×1931088−5)/18
(11×1926590+1447)/18
1922794+50566
(223×1922668+83)/18
24 75000
20 3314 G06269D
CD2449
501163AJ
J65505J
JCJ629
E566C7
3A5273
G44799
EC04297
40387404B
6271
2450
1166
658
631
568
529
449
432
392
16×206270+13
(241×202449−13)/19
5×201165+219
20658−7881
393×20629−1
(14×20568−907)/19
(67×20528−143)/19
(16×20449−2809)/19
292×20430+7
4×20391+32091
0
21 13382~13394 40473339G
B9045019E5
HD37414
BD35027B
9903323999H
530606FEK
4329236B
J233046J
9211260D
5D0198481
47336
45023
37415
35029
33244
30609
29238
23306
21128
19851
4×2147335+205
240×2145021+299
(353×2137414−13)/20
(233×2135028−53)/20
198×2133242+4175
(2130609+18455)/4
(83×2129237+157)/20
(19×2123306−5479)/20
(9×2121128−3709)/20
118×2119849+1
12 50000
22 8003 BK220015
738152L
L2385KE7
7959K7
J0767IGGJ
K0760EC1
I626AF
E60496L
L483G3
L0454B63
22003
3817
2388
961
772
764
628
499
485
458
(251×2222002−335)/21
(223817−289)/3
222388−653
(22961+857)/3
19×22771+199779
20×22763+7041
(6×22628−1259)/7
314×22497+21
22485−129
21×22457+5459
0
23 65144~65274 71906733
70D0183989
A77M716359
JL015737H
570140481
L13800B
JII013152E
HJE012455J
9B124090B
L11992D7
19069
18402
16363
15740
14051
13801
13156
12459
12412
11999
(7×2319069−2119)/22
3716×2318399+9
(2762239×2316359−7)/22
458×2315738+17
122×2314049+1
(21×2313801−241)/22
10483×2313153+14
9444×2312456+19
(19×2312411−507)/2
(21×2311999−8×237−13)/22
130 20000
24 3409 N00N8129LN
88N5951
A029518ID
D2698LD
N2644LLN
BC0331B
203137
C7298
D0259KKD
I0241I5
8134
5953
2955
2700
2647
334
315
299
263
244
13249×248131−49
201×245951−1
10×242954+5053
(13×242700+4403)/23
242647−1201
276×24332+11
2×24314+7
(283×24298−7)/23
13×24262+12013
18×24243+437
0
25 133598~133730 BH0198655NB
BMA19799O
D71D019471J
BBEF18506D
G0618466FC
L18245I8
1018157D71J
17018147DDJ
BKF0179607
9DN17957
19870
19802
19476
18510
18470
18247
18162
18152
17964
17959
292×2519868+3711
(3569×2519800+163)/12
207538×2519472+19
(57317×2518507−21)/8
(1601×2518468+923)/4
(7×2518247−711)/8
2518161+207544
32×2518150+8469
7390×2517961+7
(5735×2517957−23)/24
132 20000
26 25255~25259 M0611862BB
J044303KCB
6K233005
LD0209757
720279OL
5193916F
9GDK15920P
M8772P
K04364I5
J4222P
61190
44307
23302
20978
20281
19393
15924
8773
4367
4223
22×2661189+1649
19×2644306+13843
(34×2623301−79)/5
559×2620976+7
(7×2620281+11393)/25
(2619393+179)/5
(32569×2615921+21)/5
(22×268773+53)/25
20×264366+473
(19×264223+131)/25
4 100000
27 102831~102900 16193958
KL17469G
Q017273964
7916474G
IP1622807
1015935HN
LH151957
BF14708M
7H0H13557
A013197F9P
19397
17471
17277
16476
16231
15938
15197
14710
13560
13201
(16×2719396+23)/13
(541×2717470−151)/26
26×2717276+6727
(191×2716475+173)/26
(493×2716230−18043)/26
2715937+482
(563×2715196−277)/26
(301×2714709+167)/26
(144629×2713557−17)/26
10×2713200+11203
69 20000
28 25528~25529 O4O945359
5OA31238F
N624051LR
D0526777D
QO423969
537468P
G01899AN
A14236F
5I1370F
51332P8P
94538
31241
24054
5271
4242
3748
1902
1425
1372
1335
(6092×2894536−143)/9
(4438×2831239+125)/27
(209×2824053+3967)/9
13×285270+5697
(242×284241−4679)/9
(5×283748+2803)/27
16×281901+303
(10×281425−2899)/27
(17×281371−11)/3
(5×281335+426163)/27
1 543202
29
30 2619 OT34205
I024608D
54882J
C010221
M0547SS7
M241QB
AN206
50164B
J153QJ
J94QQJ
34206
24610
4883
1024
551
243
207
166
155
97
25×3034205−1
18×3024609+13
(5×304883+401)/29
12×301023+1
22×30550+26047
(22×30243+3139)/29
(313×30206−23)/29
5×30165+11
(19×30155+6071)/29
(19×3097+188771)/29
0
31
32 168832~169017 V09018867D
T018762F
DM18004L
F17783H
V1775333
A17650I5
8017186MJ
V6171079
V16755O3
C016737AAA9
18871
18764
18006
17784
17755
17652
17189
17109
16757
16742
31753×3218868+13
29×3218763+15
(425×3218005−53)/31
(15×3217784+47)/31
3217755−925
(10×3217652+7771)/31
8×3217188+723
(967×3217108+87)/31
3216757−253
12×3216741+338249
185 20000
33
34 184750~184834 U19778KCF
B195254B
20193714N
H0O18511X
8018215QP
7TTM18060F
B170281
H01700781
N016800DKX
Q1632105
19781
19527
19374
18514
18218
18064
17029
17010
16804
16323
(10×3419781−134067)/11
(3419527−715)/3
2×3419373+159
(6366×3418512+91)/11
8×3418217+909
(27323×3418061−23)/3
(3417029−31)/3
17×3417009+273
23×3416803+15741
(26×3416323−29891)/33
84 20000
35
36 35286~35290 P81993SZ
S0750078H
7K26567Z
J10117LJ
VL07258J
EO06177V
FZ57773P
T0946181
RY4562H
OZ3932AZ
81995
75010
26569
10119
7261
6180
5780
4621
4564
3935
(5×3681995+821)/7
28×3675009+305
(53×3626568+101)/7
(19×3610119+2501)/35
1137×367259+19
528×366178+31
16×365779−1163
(36549×364619−289)/35
(979×364563−629)/35
25×363934−901
4 100000

Related links:

https://primes.utm.edu/primes/lists/all.txt (top definitely primes)

https://primes.utm.edu/primes/lists/short.txt (definitely primes with ≥ 800000 decimal digits)

https://primes.utm.edu/primes/download.php (index page of top definitely primes)

https://primes.utm.edu/primes/search.php (search page of top definitely primes)

https://primes.utm.edu/primes/search.php?Advanced=1 (advanced search page of top definitely primes)

https://primes.utm.edu/primes/search_proth.php (search page of top definitely primes of the form k×bn±1)

http://www.primenumbers.net/prptop/prptop.php (top probable primes)

http://www.primenumbers.net/prptop/searchform.php (search page of top probable primes)

Other researches for the digits of the primes:

Left-truncatable primes (https://en.wikipedia.org/wiki/Truncatable_prime, https://primes.utm.edu/glossary/xpage/LeftTruncatablePrime.html, https://mathworld.wolfram.com/TruncatablePrime.html), i.e. every nonempty suffix is prime:

  1. http://primerecords.dk/left-truncatable.txt (base 10)
  2. http://chesswanks.com/num/LTPs/ (bases 3 to 120)
  3. https://www.ams.org/journals/mcom/1977-31-137/S0025-5718-1977-0427213-2/S0025-5718-1977-0427213-2.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_28.pdf) (bases 3 to 11)
  4. https://oeis.org/A103443 (largest left-truncatable prime in base b)
  5. https://oeis.org/A103463 (length of the largest left-truncatable prime in base b)
  6. https://oeis.org/A076623 (number of left-truncatable primes in base b)

Right-truncatable primes (https://en.wikipedia.org/wiki/Truncatable_prime, https://primes.utm.edu/glossary/xpage/RightTruncatablePrime.html, https://mathworld.wolfram.com/TruncatablePrime.html), i.e. every nonempty prefix is prime:

  1. http://primerecords.dk/right-truncatable.txt (base 10)
  2. http://fatphil.org/maths/rtp/rtp.html (bases 3 to 90)
  3. https://www.ams.org/journals/mcom/1977-31-137/S0025-5718-1977-0427213-2/S0025-5718-1977-0427213-2.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_28.pdf) (bases 3 to 15)
  4. https://oeis.org/A023107 (largest right-truncatable prime in base b)
  5. https://oeis.org/A103483 (length of the largest right-truncatable prime in base b)
  6. https://oeis.org/A076586 (number of right-truncatable primes in base b)

Other researches for the minimal elements of other subsets of positive integers written in the positional numeral system with radix b, as digit strings with subsequence ordering:

Primes == 1 mod 4:

  1. https://www.primepuzzles.net/puzzles/puzz_178.htm
  2. https://oeis.org/A111055

Primes == 3 mod 4:

  1. https://www.primepuzzles.net/puzzles/puzz_178.htm
  2. https://oeis.org/A111056

Palindromic primes:

  1. https://www.primepuzzles.net/puzzles/puzz_178.htm
  2. https://oeis.org/A114835

Composites:

  1. https://oeis.org/A071070

Squares:

  1. http://recursed.blogspot.com/2006/12/prime-game.html
  2. https://oeis.org/A130448

Powers of 2:

  1. https://oeis.org/A071071/a071071.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_13.pdf)
  2. https://oeis.org/A071071

Multiples of 3:

  1. https://oeis.org/A071073

Multiples of 4:

  1. https://oeis.org/A071072

Other sets:

  1. https://arxiv.org/pdf/1607.01548.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_14.pdf) (sums of three squares, quadratic residues mod 6, quadratic residues mod 7, range of Euler’s totient function, range of "Euler’s totient function + 3", range of Dedekind psi function, perfect numbers)
  2. https://nntdm.net/papers/nntdm-25/NNTDM-25-1-036-047.pdf (cached copy at https://github.com/xayahrainie4793/pdf-files-cached-copy/blob/main/pdf_15.pdf) (range of "Euler’s totient function + n", for 0 ≤ n ≤ 5)

Tools about this research: (in fact, you can also use Wolfram Alpha (https://www.wolframalpha.com/) or online Magma calculator (http://magma.maths.usyd.edu.au/calc/))

Prime checkers:

  1. https://primes.utm.edu/curios/includes/primetest.php
  2. https://www.numberempire.com/primenumbers.php
  3. http://www.numbertheory.org/php/lucas.html
  4. http://www.javascripter.net/math/calculators/100digitbigintcalculator.htm (just type x and click "prime?")
  5. https://www.bigprimes.net/primalitytest
  6. http://www.proftnj.com/calcprem.htm
  7. https://www.archimedes-lab.org/primOmatic.html
  8. http://www.sonic.net/~undoc/java/PrimeCalc.html

Integer factorizers:

  1. https://www.numberempire.com/numberfactorizer.php
  2. https://www.alpertron.com.ar/ECM.HTM
  3. http://www.javascripter.net/math/calculators/primefactorscalculator.htm
  4. https://betaprojects.com/calculators/prime_factors.html
  5. https://www.emathhelp.net/calculators/pre-algebra/prime-factorization-calculator/
  6. http://www.numbertheory.org/php/factor.html
  7. https://primefan.tripod.com/Factorer.html
  8. http://www.se16.info/js/factor.htm
  9. http://math.fau.edu/Richman/mla/factor-f.htm

Base converters:

  1. https://baseconvert.com/
  2. https://www.dcode.fr/base-n-convert
  3. https://www.calculand.com/unit-converter/zahlen.php
  4. https://www.cut-the-knot.org/Curriculum/Algorithms/BaseConversion.shtml
  5. http://www.tonymarston.net/php-mysql/converter.html
  6. http://math.fau.edu/Richman/mla/convert.htm
  7. http://www.kwuntung.net/hkunit/base/base.php (in Chinese)
  8. https://linesegment.web.fc2.com/application/math/numbers/RadixConversion.html (in Japanese)

List of small primes:

  1. https://primes.utm.edu/lists/small/1000.txt
  2. https://primes.utm.edu/lists/small/10000.txt
  3. https://primes.utm.edu/lists/small/100000.txt
  4. https://primes.utm.edu/lists/small/millions/
  5. https://oeis.org/A000040/a000040.txt
  6. https://oeis.org/A000040/b000040_1.txt
  7. https://oeis.org/A000040/a000040_1B.7z
  8. https://metanumbers.com/prime-numbers
  9. https://www2.cs.arizona.edu/icon/oddsends/primes.htm
  10. http://noe-education.org/D11102.php (in French)
  11. https://archive.vn/dFHCI (in Italian)
  12. https://primefan.tripod.com/500Primes1.html
  13. https://www.gutenberg.org/files/65/65.txt
  14. http://www.primos.mat.br/indexen.html
  15. https://www.walter-fendt.de/html5/men/primenumbers_en.htm
  16. http://www.rsok.com/~jrm/printprimes.html
  17. https://jocelyn.quizz.chat/np/cache/index.html
  18. https://en.wikipedia.org/wiki/List_of_prime_numbers#The_first_1000_prime_numbers

Lists of factorizations of small integers:

  1. http://primefan.tripod.com/500factored.html
  2. http://www.sosmath.com/tables/factor/factor.html
  3. https://en.wikipedia.org/wiki/Table_of_prime_factors

Lists of small integers in various bases:

  1. https://en.wikipedia.org/wiki/Table_of_bases

For the files in this page:

File "kernel b": Data for all known minimal primes in base b, expressed as base b strings

File "left b": x{y}z (where x and z are strings (may be empty) of digits in base b, y is a digit in base b) families in base b such that we were unable to determine if they contain a prime > b or not (i.e. x{y}z (where x and z are strings (may be empty) of digits in base b, y is a digit in base b) families in base b such that no prime member > b could be found, nor could the family be ruled out as only containing composites (only count the numbers > b)), these families are sorted by "the length n number in these families, from the smallest number to the largest number, this n is large enough such that n replaced to any larger number does not affect the sorting" (e.g. for base 17, we sort with B{0}B3 -> B{0}DB -> {B}2BE -> {B}2E -> {B}E9 -> {B}EE, since in this case 7 digits is enough, B0000B3 < B0000DB < BBBB2BE < BBBBB2E < BBBBBE9 < BBBBBEE, if the 7 replaced to any larger number, this sorting will not change)

See my article about this research: https://docs.google.com/document/d/e/2PACX-1vQct6Hx-IkJd5-iIuDuOKkKdw2teGmmHW-P75MPaxqBXB37u0odFBml5rx0PoLa0odTyuW67N_vn96J/pub