Computational Number Theory
eBook - PDF

Computational Number Theory

  1. 355 pages
  2. English
  3. PDF
  4. Available on iOS & Android
eBook - PDF
Book details
Table of contents
Citations

Frequently asked questions

Simply head over to the account section in settings and click on “Cancel Subscription” - it’s as simple as that. After you cancel, your membership will stay active for the remainder of the time you’ve paid for. Learn more here.
At the moment all of our mobile-responsive ePub books are available to download via the app. Most of our PDFs are also available to download and we're working on making the final remaining ones downloadable now. Learn more here.
Both plans give you full access to the library and all of Perlego’s features. The only differences are the price and subscription period: With the annual plan you’ll save around 30% compared to 12 months on the monthly plan.
We are an online textbook subscription service, where you can get access to an entire online library for less than the price of a single book per month. With over 1 million books across 1000+ topics, we’ve got you covered! Learn more here.
Look out for the read-aloud symbol on your next book to see if you can listen to it. The read-aloud tool reads text aloud for you, highlighting the text as it is being read. You can pause it, speed it up and slow it down. Learn more here.
Yes, you can access Computational Number Theory by Attila Pethoe, Michael Pohst, Hugh C. Williams, Horst G. Zimmer in PDF and/or ePUB format, as well as other popular books in Matematica & Matematica generale. We have over one million books available in our catalogue for you to explore.

Information

Publisher
De Gruyter
Year
2011
ISBN
9783110865950
Edition
1

Table of contents

  1. Preface
  2. List of contributors
  3. Table of contents
  4. On the construction of primitive elements and primitive normal bases in a finite field
  5. A numerical method for the determination of the cyclotomic polynomial coefficients
  6. Number systems
  7. Fast converging series representations of real numbers and their implementations in digital processing
  8. On a polynomial transformation and its application to the construction of a public key cryptosystem
  9. Number-theoretic transforms and a theorem of Sylvester-Kronecker- Zsigmondy
  10. A probabilistic class group and regulator algorithm and its implementation
  11. Prime-producing quadratic polynomials and class numbers of quadratic orders
  12. Applications of a new class number two criterion for real quadratic fields
  13. On a solution of a class number two problem for a family of real quadratic fields
  14. Cubic number fields with exceptional units
  15. Enumeration of totally complex quartic fields of small discriminant
  16. Class number computation by cyclotomic or elliptic units
  17. Computing fundamental units from independent units
  18. A note on index divisors
  19. Computation of independent units in number fields by a combination of the methods of Buchmann / Pethö and Pohst / Zassenhaus
  20. Hecke actions on classes of ternary quadratic forms
  21. Computation of singular moduli by multi-valued modular equations
  22. Congruent numbers and elliptic curves
  23. The rank of elliptic curves upon quadratic extension
  24. On the resolution of some diophantine equations
  25. Index form equations in cubic number fields
  26. On the practical solution of the Thue-Mahler equation
  27. Some results on Thue equations and Thue-Mahler equations
  28. On the solution of the diophantine equation Gn = P(x) with sieve algorithm
  29. On Thue equations associated with certain quartic number fields
  30. KANT - a tool for computations in algebraic number fields
  31. SIMATH - a computer algebra system