Apr 20, 2016
Small gaps between prime numbers
Yitang Zhang, UCSB
It is conjectured that there are infinitely many pairs of prime numbers
(p, q) such that
q - p = 2.
The proof of this conjecture seems to be out of reach by present
methods. For many years, it had not been known whether there are
infinitely many pairs of prime numbers (p, q) such that
0 < q - p < C,
where C is a fixed number. This was first proved by the author only
three years ago with C = 7x107. Now the value of C has
been reduced to 246. In this talk, we will briefly describe the
basic ideas and techniques that leads to such a proof.
To download: Right-click and choose "Save Link As..." (Other video options)
To begin viewing slides, click on the first slide below.
(Or, view as pdf.)
Author entry (protected)