Tag Archives: pseudoprimes

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 →

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 →