Fundamentals of discrete math for computer science. A problem-solving primer (Q2429137)

This book is dedicated to presenting the basic notions of discrete mathematics for undergraduate students in computer science. With a good balance between theory and practice -- including the algorithmic point of view -- this book will prove very helpful. A wide variety of field is covered, from integers and reals (primality, gcd, numeration bases, Newton's method for square roots\dots) to set theory and elementary combinatorics, from Boolean algebra to search/sort algorithms, from graphs and trees to sequences and series, from discrete probability to Turing machines. Many examples and exercises make the book both enjoyable and useful.