Add to ORKGA prime number is an integer bigger than l that has no factor except l and itself. A number that is ...
It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for t...
this paper, we aim at presenting the most recent results achieved in the theory of pseudoprime numbe...
UROP paper, 2012, Math and StatisticsUndergraduate Research Opportunities Program, University of Min...
summary:We use the properties of $p$-adic integrals and measures to obtain general congruences for G...
summary:We use the properties of $p$-adic integrals and measures to obtain general congruences for G...
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...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
AbstractWe describe probabilistic primality tests applicable to integers whose prime factors are all...
We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots o...
Prime numbers have always fascinated mankind. For mathematicians, they are a kind of “black sheep” o...
Whether it is applied to primality test or cryptography, pseudoprimes are one of the most important ...
A prime number is an integer bigger than l that has no factor except l and itself. A number that is ...
It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for t...
this paper, we aim at presenting the most recent results achieved in the theory of pseudoprime numbe...
UROP paper, 2012, Math and StatisticsUndergraduate Research Opportunities Program, University of Min...
summary:We use the properties of $p$-adic integrals and measures to obtain general congruences for G...
summary:We use the properties of $p$-adic integrals and measures to obtain general congruences for G...
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...
Define ψm to be the smallest strong pseudoprime to all the first m prime bases. If we know the exact...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
We present a way of viewing Lucas pseudoprimes, Euler-Lucas pseudoprimes and strong Lucas pseudoprim...
AbstractWe describe probabilistic primality tests applicable to integers whose prime factors are all...
We use Experimental Mathematics and Symbolic Computation (with Maple), to search for lots and lots o...
Prime numbers have always fascinated mankind. For mathematicians, they are a kind of “black sheep” o...
Whether it is applied to primality test or cryptography, pseudoprimes are one of the most important ...
A prime number is an integer bigger than l that has no factor except l and itself. A number that is ...
It has been known since the 1930s that so-called pseudosquares yield a very powerful machinery for t...
this paper, we aim at presenting the most recent results achieved in the theory of pseudoprime numbe...