List questions from primality-test

Published on 20 Mar 2015 - 7:59

429

Views

Conjectured Primality Test for $N=8\cdot 3^n-1$

Published on 08 Apr 2015 - 11:03

205

Views

Motivation for $r$ in AKS Primality Test

Published on 19 Apr 2015 - 17:44

1.5k

Views

Fermat witness to compositeness of $n=21$

Published on 28 Apr 2015 - 23:37

163

Views

Primality test similar to Pocklington

Published on 10 May 2015 - 15:25

149

Views

Is there an advantage in using continued fractions for Catalan or Fibonacci-Lucas primality tests?

Published on 09 Jun 2015 - 5:20

767

Views

Non existence of absolute euler pseudoprimes

Published on 26 Mar 2026 - 6:25

150

Views

Why are there not primality tests based on comparing the candidate $n$ with values of some $k \in [0,n]?$

Published on 12 Jun 2015 - 4:28

99

Views

Find all numbes $1\le a\le n-1$ which are prime to n and they are not witness Fermat of compositeness of n

Published on 06 Jul 2015 - 21:38

2k

Views

Is there a quicker way to generate integers which are hard to factor than multiplying two large primes?

Published on 08 Jul 2015 - 20:09

369

Views

Rabin-Miller compositeness

Published on 22 Jul 2015 - 11:09

294

Views

$S=\{1\le a \le n:(a,n)=1,a^{n-1}\not\equiv 1\pmod n\}$, $T=\{1\le b \le n:(b,n)=1,b^{n-1}\equiv 1\pmod n\}$ iwth composite and prime numbers

Published on 27 Jul 2015 - 19:56

694

Views

Primality of $2^{255}-19$

Published on 18 Aug 2015 - 19:24

2k

Views

Fermat primality test $\gcd$ condition and carmichael numbers

Published on 23 Aug 2015 - 5:46

371

Views

Conjectured primality test for specific class of $N=k\cdot 6^n-1$

Published on 24 Aug 2015 - 17:23

List Question

Primality test for $N=2\cdot 3^n-1$

Conjectured Primality Test for $N=8\cdot 3^n-1$

Motivation for $r$ in AKS Primality Test

Fermat witness to compositeness of $n=21$

Primality test similar to Pocklington

Is there an advantage in using continued fractions for Catalan or Fibonacci-Lucas primality tests?

Non existence of absolute euler pseudoprimes

Why are there not primality tests based on comparing the candidate $n$ with values of some $k \in [0,n]?$

Find all numbes $1\le a\le n-1$ which are prime to n and they are not witness Fermat of compositeness of n

Is there a quicker way to generate integers which are hard to factor than multiplying two large primes?

Rabin-Miller compositeness

$S=\{1\le a \le n:(a,n)=1,a^{n-1}\not\equiv 1\pmod n\}$, $T=\{1\le b \le n:(b,n)=1,b^{n-1}\equiv 1\pmod n\}$ iwth composite and prime numbers

Primality of $2^{255}-19$

Fermat primality test $\gcd$ condition and carmichael numbers

Conjectured primality test for specific class of $N=k\cdot 6^n-1$

Trending Questions

Popular # Hahtags

Popular Questions