Name: Probabilistic algorithm for testing primality
Start: 2014-09-22T18:00:00-05:00
End: 2014-09-22T21:00:00-05:00
Location: Dev Bootcamp

The Paper:

The probabilistic test for primality presented in Michael Rabin's 1977 paper is interesting because prime numbers are at the center of several high-profile algorithm problems, and because probabilistic "proofs" in general challenge naive notions of mathematical certainty. This talk will start by motivating the problem of primality testing, describe the algorithm, and do as much as is humanly possible to make the correctness proof accessible to people who don't read about number theory in their free time.

The paper can be found here: http://www.sciencedirect.com/science/article/pii/0022314X80900840

About Our Speaker:

Gary Fredericks once stood up for the entirety of a two-hour Greyhound ride because there weren't any available seats because at that point Greyhound didn't guarantee seats with your ticket and you just had to wait for the next bus on the same route if there weren't enough seats and but how on earth are you supposed to get your connecting bus in that situation.

Gary Fredericks once went on a road trip with Mike Busch where he passed the time by factoring the mile markers on the highway and Mike Busch hasn't invited him on a road trip again.

Ethan Gunderson

Papers We Love Chicago

Technology

New Technology

Papers We Love Chicago

Probabilistic algorithm for testing primality

Papers We Love Chicago

Details

Members are also interested in