# First description of the algorithms

# First description of the algorithms

This chapter provides the first, informal description of the algorithms. It explains how the computation of the Galois representations *V* attached to modular forms over finite fields should proceed. The essential step is to approximate the minimal polynomial *P* of (3.1) with sufficient precision so that *P* itself can be obtained.

*Keywords:*
modular forms, algorithms, Galois representation, finite fields

Princeton Scholarship Online requires a subscription or purchase to access the full text of books within the service. Public users can however freely search the site and view the abstracts and keywords for each book and chapter.

Please, subscribe or login to access full text content.

If you think you should have access to this title, please contact your librarian.

To troubleshoot, please check our FAQs , and if you can't find the answer there, please contact us.