Hugh C. Williams – författare

Describes the development and extension of fundamental idea of Edouard Lucas, a French mathematician and mathematical recreationist, that is still used today in the verification of the largest primes.

The objective of this book is to provide tools for solving problems which involve cubic number fields. Many such problems can be considered geometrically; both in terms of the geometry of numbers and geometry of the associated cubic Diophantine equations that are similar in many ways to the Pell equation. With over 50 geometric diagrams, this book includes illustrations of many of these topics.  The book may be thought of as a companion reference for those students of algebraic number theory who wish to find more examples, a collection of recent research results on cubic fields, an easy-to-understand source for learning about Voronoi’s unit algorithm and several classical results which are still relevant to the field, and a book which helps bridge a gap in understanding connections between algebraic geometry and number theory.The exposition includes numerous discussions on calculating with cubic fields including simple continued fractions of cubic irrational numbers, arithmetic using integer matrices, ideal class group computations, lattices over cubic fields, construction of cubic fields with a given discriminant, the search for elements of norm 1 of a cubic field with rational parametrization, and Voronoi's algorithm for finding a system of fundamental units. Throughout, the discussions are framed in terms of a binary cubic form that may be used to describe a given cubic field. This unifies the chapters of this book despite the diversity of their number theoretic topics.

Although the Lucas sequences were known to earlier investigators such as Lagrange, Legendre and Genocchi, it is because of the enormous number and variety of results involving them, revealed by Édouard Lucas between 1876 and 1880, that they are now named after him.

Although the Lucas sequences were known to earlier investigators such as Lagrange, Legendre and Genocchi, it is because of the enormous number and variety of results involving them, revealed by Édouard Lucas between 1876 and 1880, that they are now named after him.

Here, we re-examine most of the key topics Beiler covered, while introducing fresh updates and insights rooted in computational number theory.The authors aim to present efficient computer algorithms to tackle various problems that arise in the theory of numbers, providing a deeper and more modern perspective on these timeless puzzles.

No detailed description available for "Computational Number Theory".

The Proceedings contain twenty selected, refereed contributions arising from the International Conference on Public-Key Cryptography and Computational Number Theory held in Warsaw, Poland, on September 11-15, 2000. The conference, attended by eightyfive mathematicians from eleven countries, was organized by the Stefan Banach International Mathematical Center. This volume contains articles from leading experts in the world on cryptography and computational number theory, providing an account of the state of research in a wide variety of topics related to the conference theme. It is dedicated to the memory of the Polish mathematicians Marian Rejewski (1905-1980), Jerzy Róøycki (1909-1942) and Henryk Zygalski (1907-1978), who deciphered the military version of the famous Enigma in December 1932 – January 1933. A noteworthy feature of the volume is a foreword written by Andrew Odlyzko on the progress in cryptography from Enigma time until now.