Nos liseuses Vivlio rencontrent actuellement des problèmes de synchronisation. Nous faisons tout notre possible pour résoudre ce problème le plus rapidement possible. Toutes nos excuses pour la gêne occasionnée !

Retrait gratuit dans votre magasin Club
7.000.000 titres dans notre catalogue
Payer en toute sécurité
Toujours un magasin près de chez vous

Retrait gratuit dans votre magasin Club
7.000.0000 titres dans notre catalogue
Payer en toute sécurité
Toujours un magasin près de chez vous

Magasins

Wishlist

Magasins

Wishlist

Chercher

Livres

Ebooks

Papeterie

Jeux

Cadeaux

Tous les produits

Dédicaces

Jobs

Articles

42,39 €

+ 42 points

Format

Disponible immédiatement

Passer une commande en un clic

Payer en toute sécurité

Description

This book is ideal for a first or second year discrete mathematics course for mathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments with informal discussions to aid readers in understanding the presented topics. “Safe” – that is, paradox-free – informal set theory is introduced following on the heels of Russell’s Paradox as well as the topics of finite, countable, and uncountable sets with an exposition and use of Cantor’s diagonalisation technique. Predicate logic “for the user” is introduced along with axioms and rules and extensive examples. Partial orders and the minimal condition are studied in detail with the latter shown to be equivalent to the induction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions of functions and sets. Techniques for solving recurrence relations including generating functions, the O- and o-notations, and trees are provided. Over 200 end of chapter exercises are included to further aid in the understanding and applications of discrete mathematics.