List questions from primality-test

Published on 19 Jul 2016 - 9:41

160

Views

Can this function be a new test for primality?

Published on 24 Jul 2016 - 9:57

27

Views

New Generalized MR-test

Published on 24 Jul 2016 - 19:45

105

Views

New Criterion to Carmichael Numbers

Published on 25 Mar 2026 - 22:09

418

Views

Conjectured Primality Test for Repunit Numbers

Published on 06 Aug 2016 - 7:00

266

Views

Primality Test for $F_n(6)=6^{2^n}+1$

Published on 08 Aug 2016 - 15:15

441

Views

An Alternative Formulation of Lucas-Lehmer Test

Published on 15 Aug 2016 - 9:59

1.6k

Views

Euler's theorem to validate prime numbers shows non-primes as valid

Published on 18 Aug 2016 - 23:33

102

Views

Proving primality of $p$ when $p$ divides $2^n-1$ with $n$ prime.

Published on 25 Aug 2016 - 4:59

384

Views

Proving that a number passes the Miller-Rabin test

Published on 27 Aug 2016 - 12:51

223

Views

Proving that a number that passes the Miller-Rabin primality test also passes the Fermat test

Published on 31 Aug 2016 - 16:10

1.4k

Views

Pseudoprime test

Published on 25 Mar 2026 - 18:59

70

Views

Regarding the prime counting function

Published on 05 Sep 2016 - 7:30

44

Views

Why does this primality condition work? $p \ge 5 \in \Bbb P \Leftrightarrow \gcd(k,p+k)=1\ \forall k \in [3..p-1]$

Published on 15 Sep 2016 - 9:00

203

Views

Euclid's lemma, mod, gcd proof

Published on 28 Sep 2016 - 21:57

List Question

$p\in\mathbb P\iff\Big(2\leq k<\sqrt p\implies\gcd(k^2,p-k^2)=1\Big ),\;p>3$

Can this function be a new test for primality?

New Generalized MR-test

New Criterion to Carmichael Numbers

Conjectured Primality Test for Repunit Numbers

Primality Test for $F_n(6)=6^{2^n}+1$

An Alternative Formulation of Lucas-Lehmer Test

Euler's theorem to validate prime numbers shows non-primes as valid

Proving primality of $p$ when $p$ divides $2^n-1$ with $n$ prime.

Proving that a number passes the Miller-Rabin test

Proving that a number that passes the Miller-Rabin primality test also passes the Fermat test

Pseudoprime test

Regarding the prime counting function

Why does this primality condition work? $p \ge 5 \in \Bbb P \Leftrightarrow \gcd(k,p+k)=1\ \forall k \in [3..p-1]$

Euclid's lemma, mod, gcd proof

Trending Questions

Popular # Hahtags

Popular Questions