List questions from primality-test

776

Views

Prove an odd natural integer is composite if and only if it can be written in the form $n=x^2-y^2, y+1 < x$

Published on 02 Oct 2012 - 13:01

115

Views

Is This a Good Prime Sieve?

Published on 24 Oct 2012 - 20:32

169

Views

primes and patterns/representations

Published on 30 Oct 2012 - 7:28

470

Views

Lucas' primality test == finding a primitive root?

Published on 03 Nov 2012 - 13:06

827

Views

Carmichael number factoring

Published on 06 Nov 2012 - 11:46

213

Views

What is this shortcut to determine primality?

Published on 06 Dec 2012 - 2:23

1.2k

Views

Constructing arbitrary sized Miller-Rabin Primality Test Case Numbers

Published on 18 Jan 2013 - 0:07

254

Views

probability of a number not having factors below n?

Published on 22 Jan 2013 - 20:32

367

Views

Every strong pseudoprime is an Euler-Jacobi pseudoprime to base $b$

Published on 26 Mar 2026 - 10:59

811

Views

$n$ is prime iff $\binom{n^2}{n} \equiv n \pmod{n^4}$?

Published on 06 Aug 2020 - 7:37

80

Views

Primality test for specific class of $N=k \cdot 2^n+1$

Published on 01 Sep 2020 - 5:44

807

Views

Let $n=apq+1$. Prove that if $pq \ | \ \phi(n)$ then $n$ is prime.

Published on 28 Sep 2020 - 5:39

174

Views

Primality Test in Finite Fields

Published on 03 Oct 2020 - 18:11

60

Views

Is the BPSW-test always correct for special kinds of numbers?

Published on 06 Oct 2020 - 9:36

463

Views

How is the AKS primality test Rosetta code so simple?

Published on 23 Nov 2020 - 17:05

List Question

Prove an odd natural integer is composite if and only if it can be written in the form $n=x^2-y^2, y+1 < x$

Is This a Good Prime Sieve?

primes and patterns/representations

Lucas' primality test == finding a primitive root?

Carmichael number factoring

What is this shortcut to determine primality?

Constructing arbitrary sized Miller-Rabin Primality Test Case Numbers

probability of a number not having factors below n?

Every strong pseudoprime is an Euler-Jacobi pseudoprime to base $b$

$n$ is prime iff $\binom{n^2}{n} \equiv n \pmod{n^4}$?

Primality test for specific class of $N=k \cdot 2^n+1$

Let $n=apq+1$. Prove that if $pq \ | \ \phi(n)$ then $n$ is prime.

Primality Test in Finite Fields

Is the BPSW-test always correct for special kinds of numbers?

How is the AKS primality test Rosetta code so simple?

Trending Questions

Popular # Hahtags

Popular Questions