This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set

Developed from the author’s popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions o

To mark the World Mathematical Year 2000 an International Conference on Number Theory and Discrete Mathematics in honour of the legendary Indian Mathematician S

Market_Desc: As a textbook for discrete mathematics courses at the sophomore and/or junior level for both mathematics and computer science majors; and academic