An edition of Arithmetics (2011)

Arithmetics

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read
Not in Library

My Reading Lists:

Create a new list

Check-In

×Close
Add an optional check-in date. Check-in dates are used to track yearly reading goals.
Today

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Buy this book

Last edited by MARC Bot
August 24, 2024 | History
An edition of Arithmetics (2011)

Arithmetics

  • 0 Ratings
  • 0 Want to read
  • 0 Currently reading
  • 0 Have read

Number theory is a branch of mathematics which draws its vitality from a rich historical background. It is also traditionally nourished through interactions with other areas of research, such as algebra, algebraic geometry, topology, complex analysis and harmonic analysis. More recently, it has made a spectacular appearance in the field of theoretical computer science and in questions of communication, cryptography and error-correcting codes. Providing an elementary introduction to the central topics in number theory, this book spans multiple areas of research. The first part corresponds to an advanced undergraduate course. All of the statements given in this part are of course accompanied by their proofs, with perhaps the exception of some results appearing at the end of the chapters. A copious list of exercises, of varying difficulty, are also included here. The second part is of a higher level and is relevant for the first year of graduate school. It contains an introduction to elliptic curves and a chapter entitled “Developments and Open Problems”, which introduces and brings together various themes oriented toward ongoing mathematical research. Given the multifaceted nature of number theory, the primary aims of this book are to: - provide an overview of the various forms of mathematics useful for studying numbers - demonstrate the necessity of deep and classical themes such as Gauss sums - highlight the role that arithmetic plays in modern applied mathematics - include recent proofs such as the polynomial primality algorithm - approach subjects of contemporary research such as elliptic curves - illustrate the beauty of arithmetic The prerequisites for this text are undergraduate level algebra and a little topology of Rn. It will be of use to undergraduates, graduates and phd students, and may also appeal to professional mathematicians as a reference text.

Publish Date
Publisher
Springer
Language
English
Pages
321

Buy this book

Previews available in: English

Edition Availability
Cover of: Arithmetics
Arithmetics
Aug 14, 2011, Springer
paperback
Cover of: Arithmetics
Arithmetics
2011, Springer
in English

Add another edition?

Book Details


Table of Contents

1. Finite structures
2. Applications: algorithms, primality and factorization, codes
3. Algebra and diophantine equations
4. Analytic number theory
5. Elliptic curves
6. Developments and open problems.

Edition Notes

Includes bibliographical references and index.

Published in
London, New York
Series
Universitext, Universitext

Classifications

Library of Congress
QA107.2 .H3613 2011, QA241-247.5, QA107.2 .H56 2011

The Physical Object

Pagination
xviii, 321 p. :
Number of pages
321

ID Numbers

Open Library
OL25155297M
Internet Archive
arithmetics00hind
ISBN 10
1447121309, 1447121317
ISBN 13
9781447121305, 9781447121312
LCCN
2011935339
OCLC/WorldCat
740624833

Community Reviews (0)

Feedback?
No community reviews have been submitted for this work.

Lists

This work does not appear on any lists.

History

Download catalog record: RDF / JSON / OPDS | Wikipedia citation
August 24, 2024 Edited by MARC Bot import existing book
December 21, 2022 Edited by ImportBot import existing book
November 12, 2022 Edited by ImportBot import existing book
February 26, 2022 Edited by ImportBot import existing book
December 31, 2011 Created by LC Bot Imported from Library of Congress MARC record