Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Binary Quadratic Forms: Classical Theory and Modern Computations

by Duncan A. Buell
Save 35% Save 35%
Current price ₹10,900.00
Original price ₹16,769.00
Original price ₹16,769.00
Original price ₹16,769.00
(-35%)
₹10,900.00
Current price ₹10,900.00

Imported Edition - Ships in 18-21 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9781461288701
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 248
  • Original Price: EUR 149.99
  • Language: English
  • Edition: Softcover Repri
  • Item Weight: 397 grams
  • BISAC Subject(s): Number Theory, Combinatorics, and Discrete Mathematics

The first coherent exposition of the theory of binary quadratic forms was given by Gauss in the Disqnisitiones Arithmeticae. During the nine- teenth century, as the theory of ideals and the rudiments of algebraic number theory were developed, it became clear that this theory of bi- nary quadratic forms, so elementary and computationally explicit, was indeed just a special case of a much more elega, nt and abstract theory which, unfortunately, is not computationally explicit. In recent years the original theory has been laid aside. Gauss's proofs, which involved brute force computations that can be done in what is essentially a two- dimensional vector space, have been dropped in favor of n-dimensional arguments which prove the general theorems of algebraic number the- ory. In consequence, this elegant, yet pleasantly simple, theory has been neglected even as some of its results have become extremely useful in certain computations. I find this neglect unfortunate, because binary quadraticforms have two distinct attractions. First, the subject involves explicit computa- tion and many of the computer programs can be quite simple. The use of computers in experimenting with examples is both meaningful and enjoyable; one can actually discover interesting results by com- puting examples, noticing patterns in the "data," and then proving that the patterns result from the conclusion of some provable theorem.

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us