Integers, Polynomials, and Rings A Course in Algebra
Mathematics is often regarded as the study of calculation, but in fact, mathematics is much more. It combines creativity and logic in order to arrive at abstract truths. This book is intended to illustrate how calculation, creativity, and logic can be com...
(paru le 13/02/2004, consulté 2589 fois)
Geometric Methods in Algebra and Number Theory
The transparency and power of geometric constructions has been a source of inspiration to generations of mathematicians. The beauty and persuasion of pictures, communicated in words or drawings, continues to provide the intuition and arguments for working...
(paru le 22/03/2005, consulté 4799 fois)
Number Theory An approach through history from Hammurapi to Legendre
Number Theory or arithmetic, as some prefer to call it, is the oldest, purest, liveliest, most elementary yet sophisticated field of mathematics. It is no coincidence that the fundamental science of numbers has come to be known as the "Queen of Mathematic...
(paru le 29/01/2007, consulté 4805 fois)
An Invitation to Modern Number Theory
In a manner accessible to beginning undergraduates, An Invitation to Modern Number Theory introduces many of the central problems, conjectures, results, and techniques of the field, such as the Riemann Hypothesis, Roth's Theorem, the Circle Method, and Ra...
(paru le 28/04/2006, consulté 4274 fois)
Traités sur la théorie des nombres
Richard Dedekind (1831-1916) a été, à Göttingen, le dernier élève de Gauss, avant de suivre les leçons de Dirichlet. Avec ses travaux sur les fondements des mathématiques, Dedekind a acquis une renommée qui a débordé le cercle restreint des algébristes de...
(paru le 03/04/2006, consulté 4486 fois)
The Mathematics of Ciphers Number Theory and RSA Cryptography
This book is an introduction to the algorithmic aspects of number theory and its applications to cryptography, with special emphasis on the RSA cryptosys-tem. It covers many of the familiar topics of elementary number theory, all with an algorithmic twist...
(paru le 01/01/1999, consulté 4200 fois)
Primality Testing in Polynomial Time From Randomized Algorithms to
This book is devoted to algorithms for the venerable primality problem: Given a natural number n, decide whether it is prime or composite.
The problem is basic in number theory, efficient algorithms that solve it, i.e., algorithms that run in a number ...
(paru le 09/07/2004, consulté 3903 fois)
Comprehensive Mathematics for Computer Scientists 1 Sets and Numbers, Graphs and Algebra, Logic and Machines, Linear Geometry
This two-volume textbook Comprehensive Mathematics for Computer Scientists is a self-contained comprehensive presentation of mathematics including sets, numbers, graphs, algebra, logic, grammars, machines, linear geometry, calculus, ODEs, and special them...
(paru le 20/04/2004, consulté 5288 fois)
Selected papers on discrete mathematics
Donald Knuth's influence in computer science ranges from the invention of methods for translating and defining programming languages to the mathematical analysis of algorithms and the creation of theT£X typesetting system.
His award-winning textbooks hav...
(paru le 07/04/2004, consulté 5721 fois)
Elementary Number Theory, Group Theory and Ramanujan Graphs
This text is a self contained treatment of expander
graphs and in particular their explicit construction.
Expander graphs are both highly connected but sparse, and
besides their interest within combinatorics and graph
theory, they also find various applic...
(paru le 13/03/2003, consulté 4570 fois)