Higher arithmetic : (Record no. 67010)

MARC details
000 -LEADER
fixed length control field 02214nam a22001697a 4500
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION
fixed length control field 210804b2008 ||||| |||| 00| 0 eng d
020 ## - INTERNATIONAL STANDARD BOOK NUMBER
International Standard Book Number 9781470454814
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER
Classification number 512.7 EDW-H
100 ## - MAIN ENTRY--PERSONAL NAME
Personal name Edwards, Harold M.
245 ## - TITLE STATEMENT
Title Higher arithmetic :
Remainder of title an algorithmic introduction to number theory /
Statement of responsibility, etc. Harold M. Edwards
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT)
Place of publication, distribution, etc. USA
Name of publisher, distributor, etc. American Mathematical Society
Date of publication, distribution, etc. 2008
300 ## - PHYSICAL DESCRIPTION
Extent 210 p.
365 ## - TRADE PRICE
Price type code INR
Price amount 1020.00.
440 ## - SERIES STATEMENT/ADDED ENTRY--TITLE
Title Student Mathematical Library /
Volume/sequential designation Vol : 45
500 ## - GENERAL NOTE
General note Although number theorists have sometimes shunned and even disparaged computation in the past, today's applications of number theory to cryptography and computer security demand vast arithmetical computations. These demands have shifted the focus of studies in number theory and have changed attitudes toward computation itself.<br/><br/>The important new applications have attracted a great many students to number theory, but the best reason for studying the subject remains what it was when Gauss published his classicDisquisitiones Arithmeticae in 1801: Number theory is the equal of Euclidean geometry—some would say it is superior to Euclidean geometry—as a model of pure, logical, deductive thinking. An arithmetical computation, after all, is the purest form of deductive argument.<br/><br/>Higher Arithmetic explains number theory in a way that gives deductive reasoning, including algorithms and computations, the central role. Hands-on experience with the application of algorithms to computational examples enables students to master the fundamental ideas of basic number theory. This is a worthwhile goal for any student of mathematics and an essential one for students interested in the modern applications of number theory.<br/><br/>Harold M. Edwards is Emeritus Professor of Mathematics at New York University. His previous books are Advanced Calculus (1969, 1980, 1993), Riemann's Zeta Function (1974, 2001),Fermat's Last Theorem (1977), Galois Theory (1984), Divisor Theory (1990), Linear Algebra (1995), and Essays in Constructive Mathematics (2005). For his masterly mathematical exposition he was awarded a Steele Prize as well as a Whiteman Prize by the American Mathematical Society.
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM
Topical term or geographic name as entry element Number theory
952 ## - LOCATION AND ITEM INFORMATION (KOHA)
Withdrawn status
Holdings
Lost status Source of classification or shelving scheme Damaged status Not for loan Collection code Home library Current library Shelving location Date acquired Total Checkouts Full call number Barcode Date last seen Date last checked out Price effective from Koha item type
  Dewey Decimal Classification     510 BITS Pilani Hyderabad BITS Pilani Hyderabad General Stack (For lending) 04/08/2021 2 512.7 EDW-H 42378 13/07/2024 18/01/2024 04/08/2021 Books
An institution deemed to be a University Estd. Vide Sec.3 of the UGC
Act,1956 under notification # F.12-23/63.U-2 of Jun 18,1964

© 2024 BITS-Library, BITS-Hyderabad, India.