Elementary Number Theory : Primes, Congruences, and Secrets : A Computational Approach William Stein.
Series: Undergraduate texts in mathematicsPublication details: New York, NY : Springer, c2009.Description: x, 166 p. : ill. ; 25 cmISBN:- 9780521099493
- 512.7 ST34E 23
- QA241 .S76 2009
Contents:
Prime numbers -- The ring of integers modulo n -- Public-key cryptography -- Quadratic reciprocity -- Continued fractions -- Elliptic curves.
Item type | Current library | Call number | Status | Date due | Barcode | |
---|---|---|---|---|---|---|
![]() |
Central Library, IISER Bhopal General Section | 512.7 ST34E (Browse shelf(Opens below)) | Available | 7262 |
Browsing Central Library, IISER Bhopal shelves, Shelving location: General Section Close shelf browser (Hides shelf browser)
512.7 N195M Methods in number theory | 512.7 N917N Number theory and modular forms: | 512.7 R722N Number theory in function fields | 512.7 ST34E Elementary Number Theory : | 512.72 B953E6 Elementary number theory | 512.72 D444P Prime obsession: | 512.72 N95A Additive number theory: |
Includes bibliographical references (p. [155]-159) and index.
Prime numbers -- The ring of integers modulo n -- Public-key cryptography -- Quadratic reciprocity -- Continued fractions -- Elliptic curves.
There are no comments on this title.
Log in to your account to post a comment.