It is named after Ferdinand Georg Frobenius. The test uses the concepts of quadratic polynomials and the Frobenius automorphism. It should not be confused...

In number theory, a Frobenius pseudoprime is a pseudoprime, whose definition was inspired by the quadratic Frobenius test described by Jon Grantham in...

Frobenius's theorem (group theory) Frobenius conjecture Frobenius–Schur indicator Perron–Frobenius theorem Quadratic Frobenius test Rouché–Frobenius theorem...

Miller–Rabin. The Frobenius test is a generalization of the Lucas probable prime test. The Baillie–PSW primality test is a probabilistic primality test that combines...

a Fourier transform acting on quantum bits Quadratic Frobenius test, a primality test QuantiFERON, a test for tuberculosis infection or latent tuberculosis...

the correctness of the test: as we deal with subgroups of even index, it suffices to assume the validity of GRH for quadratic Dirichlet characters. The...

In mathematics, the Lucas–Lehmer test (LLT) is a primality test for Mersenne numbers. The test was originally developed by Édouard Lucas in 1878 and subsequently...

The quadratic sieve algorithm (QS) is an integer factorization algorithm and, in practice, the second-fastest method known (after the general number field...

The Fermat primality test is a probabilistic test to determine whether a number is a probable prime. Fermat's little theorem states that if p is prime...

The AKS primality test (also known as Agrawal–Kayal–Saxena primality test and cyclotomic AKS test) is a deterministic primality-proving algorithm created...