0
Your cart

Your cart is empty

Books > Science & Mathematics > Mathematics > Number theory

Buy Now

Modular Forms: A Classical And Computational Introduction (2nd Edition) (Hardcover, 2nd Revised edition) Loot Price: R2,152
Discovery Miles 21 520
Modular Forms: A Classical And Computational Introduction (2nd Edition) (Hardcover, 2nd Revised edition): Lloyd James Peter...

Modular Forms: A Classical And Computational Introduction (2nd Edition) (Hardcover, 2nd Revised edition)

Lloyd James Peter Kilford

 (sign in to rate)
Loot Price R2,152 Discovery Miles 21 520 | Repayment Terms: R202 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

Modular Forms is a graduate student-level introduction to the classical theory of modular forms and computations involving modular forms, including modular functions and the theory of Hecke operators. It also includes applications of modular forms to various subjects, such as the theory of quadratic forms, the proof of Fermat's Last Theorem and the approximation of . The text gives a balanced overview of both the theoretical and computational sides of its subject, allowing a variety of courses to be taught from it.This second edition has been revised and updated. New material on the future of modular forms as well as a chapter about longer-form projects for students has also been added.

General

Imprint: Imperial College Press
Country of origin: United Kingdom
Release date: April 2015
First published: 2015
Authors: Lloyd James Peter Kilford
Dimensions: 237 x 158 x 18mm (L x W x T)
Format: Hardcover
Pages: 252
Edition: 2nd Revised edition
ISBN-13: 978-1-78326-545-9
Categories: Books > Science & Mathematics > Mathematics > Number theory > General
LSN: 1-78326-545-0
Barcode: 9781783265459

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners