Question

What's the best software for primality tests of huge numbers? (check if an integer is prime or not)

score 3.1k · Answer 1 · 2026-03-25 23:39:26

3.1k

Views

What's the best software for primality tests of huge numbers? (check if an integer is prime or not)

Published on 25 Mar 2026 - 23:39

score 1.2k · Answer 2 · 2014-07-18 08:01:14

1.2k

Views

Fast check of safe primes or Sophie Germain primes

Published on 18 Jul 2014 - 8:01

score 113 · Answer 3 · 2014-07-26 15:13:29

113

Views

If $p$ is prime, prove that $\exists k\in\lbrace 5,-7,9,-11,..\rbrace$ in $(\mathbb{Z}/p\mathbb{Z})^*$ so that the Legendre symbol $(\frac{k}{p})=-1$

Published on 26 Jul 2014 - 15:13

score 422 · Answer 4 · 2026-03-25 19:05:32

422

Views

Are there any primes that are never a factor of a Carmichael number?

Published on 25 Mar 2026 - 19:05

score 3.4k · Answer 5 · 2014-08-14 12:44:21

3.4k

Views

Fastest way to find if a given number is prime

Published on 14 Aug 2014 - 12:44

score 92 · Answer 6 · 2014-10-06 21:53:35

92

Views

Proof for divisibility on a prime test: $\frac{(p-1)!}{(n!(p-n)!)}$

Published on 06 Oct 2014 - 21:53

score 3.3k · Answer 7 · 2026-02-23 01:05:12

3.3k

Views

Is it true that $2^{p}-1$ is a prime number?

Published on 23 Feb 2026 - 1:05

score 148 · Answer 8 · 2014-10-20 20:05:09

148

Views

PRIMES is in P, page 4: Why is $(X+a)^{\frac{n}{p}} \equiv X^{\frac{n}{p}}+a$ implied?

Published on 20 Oct 2014 - 20:05

score 166 · Answer 9 · 2014-10-26 17:27:48

166

Views

A Generalization of Carmichael Numbers

Published on 26 Oct 2014 - 17:27

score 152 · Answer 10 · 2014-10-27 11:40:31

152

Views

Primality Criterion for Specific Class of Proth Numbers

Published on 27 Oct 2014 - 11:40

score 260 · Answer 11 · 2014-10-28 14:08:40

260

Views

Primality of $n! +1$

Published on 28 Oct 2014 - 14:08

score 200 · Answer 12 · 2014-10-31 07:07:11

200

Views

Primality Test for Safe Primes

Published on 31 Oct 2014 - 7:07

score 2.2k · Answer 13 · 2014-11-03 21:17:22

2.2k

Views

Bases required for prime-testing with Miller-Rabin up to $2^{63}-1$

Published on 03 Nov 2014 - 21:17

score 86 · Answer 14 · 2014-11-20 14:15:54

86

Views

Finding a lower bound to the probability that a number will be shown to be composite?

Published on 20 Nov 2014 - 14:15

score 189 · Answer 15 · 2014-12-08 10:05:25

189

Views

Make a prime number from specified number, by concatenating some more digits on its right?

Published on 08 Dec 2014 - 10:05

List Question

What's the best software for primality tests of huge numbers? (check if an integer is prime or not)

Fast check of safe primes or Sophie Germain primes

If $p$ is prime, prove that $\exists k\in\lbrace 5,-7,9,-11,..\rbrace$ in $(\mathbb{Z}/p\mathbb{Z})^*$ so that the Legendre symbol $(\frac{k}{p})=-1$

Are there any primes that are never a factor of a Carmichael number?

Fastest way to find if a given number is prime

Proof for divisibility on a prime test: $\frac{(p-1)!}{(n!(p-n)!)}$

Is it true that $2^{p}-1$ is a prime number?

PRIMES is in P, page 4: Why is $(X+a)^{\frac{n}{p}} \equiv X^{\frac{n}{p}}+a$ implied?

A Generalization of Carmichael Numbers

Primality Criterion for Specific Class of Proth Numbers

Primality of $n! +1$

Primality Test for Safe Primes

Bases required for prime-testing with Miller-Rabin up to $2^{63}-1$

Finding a lower bound to the probability that a number will be shown to be composite?

Make a prime number from specified number, by concatenating some more digits on its right?

Trending Questions

Popular # Hahtags

Popular Questions