Submitted by jlongwor on Fri, 01/30/2009 - 10:31am.
Jan 30 2009 - 4:00pm
Jan 30 2009 - 4:50pm
Speaker:
Andrew Shallue
Location:
ICT 616
The Miller-Rabin
test is the primality test most often used in practice. The probability of success
depends on the size of an object called the set of strong liars.
I will give classes of composite n with both large and small sets of strong liars, and
give asymptotic bounds on the size of these classes.
