-
Recent Posts
Archives
- May 2020
- April 2020
- March 2020
- June 2018
- July 2016
- June 2016
- May 2016
- March 2015
- February 2015
- January 2015
- December 2014
- December 2013
- November 2013
- July 2013
- June 2013
- May 2013
- March 2013
- February 2013
- January 2013
- December 2012
- November 2012
- October 2012
- September 2012
- August 2012
- April 2012
- March 2012
- February 2012
- January 2012
- December 2011
- November 2011
- October 2011
Categories
Meta
Pages
Tag Archives: pseudoprimes
Primality Tests II
In this article, we discuss some ways of improving the basic Fermat test. Recall that for Fermat test, to test if n is prime, one picks a base a < n and checks if We also saw that this method would utterly fail … Continue reading
Posted in Uncategorized
Tagged carmichael numbers, cryptography, elementary, number theory, primality tests, primes, pseudoprimes
Leave a comment
Primality Tests I
Description of Problem The main problem we wish to discuss is as follows. Question. Given n, how do we determine if it is prime? Prime numbers have opened up huge avenues in theoretical research – the renowned Riemann Hypothesis, for … Continue reading
Posted in Uncategorized
Tagged carmichael numbers, cryptography, elementary, number theory, primality tests, primes, pseudoprimes
Leave a comment