University of Ottawa, Canada 2006-03-10 G3.33 The theory of linear recurrences has a rich history, and has close connection to more applied topics such as primality testing, integer factorization and public-key cryptography.
In this talk we will discuss these connections, and explore tendencies in the factorization of terms which appear in particular class of such sequences; the so-called Lucas sequences.
We discuss some of the more pertinent results on this topic, some related open problems, and recent progress being made by way of the modularity of elliptic curves.
|