Add to ORKGWe use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots of Perrin- and Lucas- style primality tests, and try to sort the wheat from the chaff. More impressively, we find quite a few such primality tests for which we can explicitly construct infinite families of pseudo-primes, rather, like in the cases of Perrin pseudo-primes and the famous Carmichael primes, only proving the mere existence of infinitely many of them.Comment: 9 pages. Accompanied by a Maple package and numerous output files from <A HREF="https://sites.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/perrin.html">this url. This version corrects two typos pointed out by OEIS editor Hugo Pfoertner, and lists the 7 smallest pseudo...
Whether it is applied to primality test or cryptography, pseudoprimes are one of the most important ...
AbstractPrimality testing of large numbers is very important in many areas of mathematics, computer ...
In 1980, L. Adleman, C. Pomerance, and R. Rumely invented the first cyclotomicprimality test, and sh...
The calculation of many and large Perrin pseudoprimes is a challenge. This is mainly due to their ra...
It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for t...
In this paper we generalize the classical Proth's theorem and the Miller-Rabin test for integers of ...
International audienceWe propose a pseudo-primality test using cyclic extensions of $Z/nZ$. For ever...
International audienceWe propose a pseudo-primality test using cyclic extensions of $Z/nZ$. For ever...
AbstractWe describe probabilistic primality tests applicable to integers whose prime factors are all...
The Fundamental Theorem of Arithmetic states that every composite integer can be written as a unique...
According to the Berrizbeitia theorem, a highly efficient method for certifying the primality of an ...
Every 10 minutes, the amount of human generated data expands by more than 10 petabyes. This is equiv...
Every 10 minutes, the amount of human generated data expands by more than 10 petabyes. This is equiv...
UROP paper, 2012, Math and StatisticsUndergraduate Research Opportunities Program, University of Min...
AbstractWe present a prime certification method which permits shorter certificates of primality than...
Whether it is applied to primality test or cryptography, pseudoprimes are one of the most important ...
AbstractPrimality testing of large numbers is very important in many areas of mathematics, computer ...
In 1980, L. Adleman, C. Pomerance, and R. Rumely invented the first cyclotomicprimality test, and sh...
The calculation of many and large Perrin pseudoprimes is a challenge. This is mainly due to their ra...
It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for t...
In this paper we generalize the classical Proth's theorem and the Miller-Rabin test for integers of ...
International audienceWe propose a pseudo-primality test using cyclic extensions of $Z/nZ$. For ever...
International audienceWe propose a pseudo-primality test using cyclic extensions of $Z/nZ$. For ever...
AbstractWe describe probabilistic primality tests applicable to integers whose prime factors are all...
The Fundamental Theorem of Arithmetic states that every composite integer can be written as a unique...
According to the Berrizbeitia theorem, a highly efficient method for certifying the primality of an ...
Every 10 minutes, the amount of human generated data expands by more than 10 petabyes. This is equiv...
Every 10 minutes, the amount of human generated data expands by more than 10 petabyes. This is equiv...
UROP paper, 2012, Math and StatisticsUndergraduate Research Opportunities Program, University of Min...
AbstractWe present a prime certification method which permits shorter certificates of primality than...
Whether it is applied to primality test or cryptography, pseudoprimes are one of the most important ...
AbstractPrimality testing of large numbers is very important in many areas of mathematics, computer ...
In 1980, L. Adleman, C. Pomerance, and R. Rumely invented the first cyclotomicprimality test, and sh...