Counting Squarefree Numbers with the Sieve
Xiaoyu He (Harvard)
Saturday, 7 February 2015, 1:55 PM
MIT, 56-154
This talk will give a gentle introduction to sieve theory by replacing all occurrences of the word "prime" by the word "squarefree." Join us to count the number of squarefree numbers up to n, the number of squarefree numbers in an arithmetic progression, and the number of twin squarefree numbers. If time permits we will introduce the more delicate sieve of Brun to bound twin primes.