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.Â
General
Imprint: |
Springer International Publishing AG
|
Country of origin: |
Switzerland |
Series: |
Synthesis Lectures on Mathematics & Statistics |
Release date: |
September 2023 |
First published: |
2024 |
Authors: |
George Tourlakis
|
Dimensions: |
240 x 168mm (L x W) |
Pages: |
250 |
Edition: |
1st ed. 2024 |
ISBN-13: |
978-3-03-130487-3 |
Categories: |
Books
|
LSN: |
3-03-130487-X |
Barcode: |
9783031304873 |
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!