Atkin-Swinnerton-Dyer Congruences on Noncongruence Modular Forms

Speaker  Winnie Li

Host  Kristin Lauter

Affiliation  Penn State

Duration  01:01:30

Date recorded  21 October 2010

This presentation has two parts. The first half discusses the major factorization algorithms when ECM was discovered in 1985, stressing the similarities between ECM and P +- 1. The second half describes the recent discoveries of six large Mersenne factors using ECM on a network of PlayStations.

This is joint work with Joppe W. Bos, Thorsten Kleinjung, and Arjen K. Lenstra from EPFL.

©2010 Microsoft Corporation. All rights reserved.
> Atkin-Swinnerton-Dyer Congruences on Noncongruence Modular Forms