Titre :	Discrete Mathematics and Applications
Type de document :	texte imprimé
Auteurs :	Ferland Kevin, Auteur
Année de publication :	2023
Importance :	1 vol. (52 p.)
Format :	24 cm
ISBN/ISSN/EAN :	978-1-03-247689-6
Langues :	Anglais (eng)
Catégories :	Mathématique
Mots-clés :	Mathématique
Index. décimale :	510 Mathématique
Résumé :	Discrete Mathematics and Applications, Second Edition is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part one focuses on how to write proofs, then moves on to topics in number theory, employing set theory in the process. Part two focuses on computations, combinatorics, graph theory, trees, and algorithms. Emphasizes proofs, which will appeal to a subset of this course market Links examples to exercise sets Offers edition that has been heavily reviewed and developed Focuses on graph theory Covers trees and algorithms
Côte titre :	Fs/25045

Discrete Mathematics and Applications [texte imprimé] / Ferland Kevin, Auteur . - 2023 . - 1 vol. (52 p.) ; 24 cm.
ISBN : 978-1-03-247689-6
Langues : Anglais (eng)

Catégories :	Mathématique
Mots-clés :	Mathématique
Index. décimale :	510 Mathématique
Résumé :	Discrete Mathematics and Applications, Second Edition is intended for a one-semester course in discrete mathematics. Such a course is typically taken by mathematics, mathematics education, and computer science majors, usually in their sophomore year. Calculus is not a prerequisite to use this book. Part one focuses on how to write proofs, then moves on to topics in number theory, employing set theory in the process. Part two focuses on computations, combinatorics, graph theory, trees, and algorithms. Emphasizes proofs, which will appeal to a subset of this course market Links examples to exercise sets Offers edition that has been heavily reviewed and developed Focuses on graph theory Covers trees and algorithms
Côte titre :	Fs/25045