9783031304873 - discrete mathematics: a concise introduction (synthesis lectures on mathematics & statistics) von tourlakis, george (8 Ergebnisse)
- Hardcover
Anbieter: Books From California, Simi Valley, USABooks From California
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Gebraucht - Gut
EUR 33,59
EUR 4,33 VersandVersand innerhalb von USAAnzahl: 1 verfügbar
hardcover. Zustand: Very Good.
- Hardcover
Anbieter: Majestic Books, Hounslow, Vereinigtes KönigreichMajestic Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 4 SternenZustand: Neu
EUR 45,14
EUR 7,52 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 4 verfügbar
Zustand: New.
- Hardcover
Anbieter: Romtrade Corp., STERLING HEIGHTS, USARomtrade Corp.
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 53,25
Versand nach gratisVersand innerhalb von USAAnzahl: 2 verfügbar
Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
- Hardcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 41,68
EUR 14,46 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: Brand New. 271 pages. 9.45x6.61x0.83 inches. In Stock.
- Hardcover
Anbieter: Revaluation Books, Exeter, Vereinigtes KönigreichRevaluation Books
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 75,12
EUR 14,46 VersandVersand von Vereinigtes Königreich nach USAAnzahl: 1 verfügbar
Hardcover. Zustand: Brand New. 271 pages. 9.45x6.61x0.83 inches. In Stock.
- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 48,14
EUR 63,19 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book is ideal for afirst or second year discrete mathematics course formathematics, engineering, and computer science majors. The author has extensively class-tested early conceptions of the book over the years and supplements mathematical arguments wi…th 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 theminimal conditionare studied in detail with the latter shown to be equivalent to theinduction principle. Mathematical induction is illustrated with several examples and is followed by a thorough exposition of inductive definitions offunctionsandsets. 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.
- Hardcover
Anbieter: Buchpark, Trebbin, DeutschlandBuchpark
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht - Gut
EUR 21,79
EUR 105,00 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Zustand: Gut. Zustand: Gut | Seiten: 272 | Sprache: Englisch | Produktart: Bücher | 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.
- Hardcover
Anbieter: Buchpark, Trebbin, DeutschlandBuchpark
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Gebraucht
EUR 22,44
EUR 105,00 VersandVersand von Deutschland nach USAAnzahl: 2 verfügbar
Zustand: Hervorragend. Zustand: Hervorragend | Seiten: 272 | Sprache: Englisch | Produktart: Bücher | 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 supple…ments 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.
