A Course in Number Theory and Cryptography


Book Description

This is a substantially revised and updated introduction to arithmetic topics, both ancient and modern, that have been at the centre of interest in applications of number theory, particularly in cryptography. As such, no background in algebra or number theory is assumed, and the book begins with a discussion of the basic number theory that is needed. The approach taken is algorithmic, emphasising estimates of the efficiency of the techniques that arise from the theory, and one special feature is the inclusion of recent applications of the theory of elliptic curves. Extensive exercises and careful answers are an integral part all of the chapters.




Discrete Mathematics and Its Applications


Book Description

The companion Web site -- To the student -- The foundations : logic, sets, and functions -- The fundamentals : algorithms, the integers, and matrices -- Mathematical reasoning -- Counting -- Advanced counting techniques -- Relations -- Graphs -- Trees -- Boolean algebra -- Modeling computation




Acing the New SAT Math


Book Description

SAT MATH TEST BOOK




Invariance Theory


Book Description

This book treats the Atiyah-Singer index theorem using the heat equation, which gives a local formula for the index of any elliptic complex. Heat equation methods are also used to discuss Lefschetz fixed point formulas, the Gauss-Bonnet theorem for a manifold with smooth boundary, and the geometrical theorem for a manifold with smooth boundary. The author uses invariance theory to identify the integrand of the index theorem for classical elliptic complexes with the invariants of the heat equation.




Number Theory


Book Description

This two-volume book is a modern introduction to the theory of numbers, emphasizing its connections with other branches of mathematics. Part A is accessible to first-year undergraduates and deals with elementary number theory. Part B is more advanced and gives the reader an idea of the scope of mathematics today. The connecting theme is the theory of numbers. By exploring its many connections with other branches a broad picture is obtained. The book contains a treasury of proofs, several of which are gems seldom seen in number theory books.




Problems in Algebraic Number Theory


Book Description

The problems are systematically arranged to reveal the evolution of concepts and ideas of the subject Includes various levels of problems - some are easy and straightforward, while others are more challenging All problems are elegantly solved




Elementary Topology


Book Description

This text contains a detailed introduction to general topology and an introduction to algebraic topology via its most classical and elementary segment. Proofs of theorems are separated from their formulations and are gathered at the end of each chapter, making this book appear like a problem book and also giving it appeal to the expert as a handbook. The book includes about 1,000 exercises.




The Art and Craft of Problem Solving


Book Description

This text on mathematical problem solving provides a comprehensive outline of "problemsolving-ology," concentrating on strategy and tactics. It discusses a number of standard mathematical subjects such as combinatorics and calculus from a problem solver's perspective.




The Four Pillars of Geometry


Book Description

This book is unique in that it looks at geometry from 4 different viewpoints - Euclid-style axioms, linear algebra, projective geometry, and groups and their invariants Approach makes the subject accessible to readers of all mathematical tastes, from the visual to the algebraic Abundantly supplemented with figures and exercises




Computational Topology


Book Description

Combining concepts from topology and algorithms, this book delivers what its title promises: an introduction to the field of computational topology. Starting with motivating problems in both mathematics and computer science and building up from classic topics in geometric and algebraic topology, the third part of the text advances to persistent homology. This point of view is critically important in turning a mostly theoretical field of mathematics into one that is relevant to a multitude of disciplines in the sciences and engineering. The main approach is the discovery of topology through algorithms. The book is ideal for teaching a graduate or advanced undergraduate course in computational topology, as it develops all the background of both the mathematical and algorithmic aspects of the subject from first principles. Thus the text could serve equally well in a course taught in a mathematics department or computer science department.