The Fermat primality test is a probabilistic test to determine whether a number is a probable prime.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

We investigate the probability that a random odd composite number passes a random Fermat primality test, improving on earlierâ€¦Â (More)

Is this relevant?

Review

2015

Review

2015

- FpT, Keith Conrad
- 2015

Let Fp = Z/(p) be a field of prime order. We will discuss a few methods of checking if a polynomial f(T ) âˆˆ Fp[T ] is irreducibleâ€¦Â (More)

Is this relevant?

2014

2014

- Hosung Jo, Heejin Park
- 2014 International Conference on Big Data andâ€¦
- 2014

JPV algorithm, proposed by Joye et al. was predicted to be faster than the combined prime generation algorithm but it runs slowerâ€¦Â (More)

Is this relevant?

2014

2014

- Hosung Jo, Heejin Park
- 2014

JPV algorithm, proposed by Joye et al. was predicted to be faster than the combined prime generation algorithm but it runs slowerâ€¦Â (More)

Is this relevant?

2014

2014

Cunningham chains of length n of the first kind are n long sequences of prime numbers p1, p2, . . . , pn so that pi+1 = 2pi + 1â€¦Â (More)

Is this relevant?

2011

2005

2004

2004

- Masanari Kida
- Experimental Mathematics
- 2004

The first deterministic polynomial-time algorithm for primality testing by Agrawal, Kayal, and Saxena [Agrawal et al. 02] hasâ€¦Â (More)

Is this relevant?

2000

2000

- Pedro Berrizbeitia, Thomas G. Berry
- J. Symb. Comput.
- 2000

For n odd, the strong pseudoprime primality test (also called the Millerâ€“Rabin test c.f. Miller, 1976, Rabin, 1980, Koblitz, 1987â€¦Â (More)

Is this relevant?

1999

1999

- Siguna MÃ¼ller
- IMA Int. Conf.
- 1999

Based on the well-known Baillie/Wagstaff suggestion [2] we introduce a rapid pseudoprimality test with high confidence. The testâ€¦Â (More)

Is this relevant?