FreeComputerBooks.com
Links to Free Computer, Mathematics, Technical Books all over the World


 Title: A Spiral Workbook for Discrete Mathematics
 Author(s) Harris Kwong
 Publisher: Open SUNY Textbooks; 1 edition (December 18, 2015)
 License(s): CC BYNCSA
 Paperback: 306 pages
 eBook: PDF
 Language: English
 ISBN10: 1942341180
 ISBN13: 9781942341185
 Share This:
Book Description
This is a textbook that covers the standard topics in a sophomorelevel course in discrete mathematics: logic, sets, proof techniques, basic number theory, functions, relations, and elementary combinatorics, with an emphasis on motivation. It explains and clarifies the unwritten conventions in mathematics, and guides the students through a detailed discussion on how a proof is revised from its draft to a final polished form. Handson exercises help students understand a concept soon after learning it.
The text adopts a spiral approach: many topics are revisited multiple times, sometimes from a different perspective or at a higher level of complexity. The goal is to slowly develop studentsâ€™ problemsolving and writing skills.
About the Authors Harris Kwong is a mathematics professor at SUNY Fredonia. He was born and raised in Hong Kong. After finishing high school there, he came to the United States to further his education. He received his B.S. and M.S. degrees from the University of Michigan, and Ph.D. from the University of Pennsylvania. His research focuses on combinatorics, number theory, and graph theory. His work appears in many international mathematics journals.
 Discrete and Finite Mathematics
 Mathematical and Computational Software, MATLAB, etc.
 Algebra and Abstract Algebra
 Numerical Analysis and Scientific Computing

Mathematical Foundations and Aspects of Discrete Mathematics
This is a book about discrete mathematics which also discusses mathematical reasoning and logic. It offers an introduction to discrete mathematics for undergraduate students in computer science and mathematics.

Discrete Differential Geometry (Alexander I. Bobenko)
An emerging field of Discrete Differential Geometry (DDG) aims at the development of discrete equivalents of notions and methods of classical differential geometry. No knowledge of differential geometry is expected.

Elements of Discrete Mathematics (Richard Hammack)
This book explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upperlevel mathematics courses of the computer age.

A Cool Brisk Walk Through Discrete Mathematics (Stephen Davies)
This is a completely and forever free and open source educational materials dedicated to the mathematics that budding computer science practitioners actually need to know. They feature the fun and addictive teaching of awardwinning lecturer!

Mathematics for Computer Science (Eric Lehman, et al)
This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. explores the topics of basic combinatorics, number and graph theory, logic and proof techniques.

Discrete Mathematics: An Open Introduction (Oscar Levin)
This is a gentle introduction to discrete mathematics. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.

Isomorphism  Mathematics of Programming (Xinyu Liu)
This book introduces the mathematics behind computer programming. It intents to tell: programming is isomorphic to mathematics. Just like in art and music, there are interesting stories and mathematicians behind the great minds.

Applied Discrete Structures, Fundamentals (Al Doerr, et al)
This book contains most of the fundamental concepts taught in a one semester course in discrete mathematics which is a required course for students in Computer Science, Mathematics and Information Technology.

Advances in Discrete Differential Geometry (Alexander Bobenko)
It surveys the fascinating connections between discrete models in differential geometry and complex analysis, integrable systems and applications in computer graphics and is illustrated to convince readers it's both beautiful and useful.

Discrete Structures for Computer Science: Counting, Recursion
This book provides a broad introduction to some of the most fascinating and beautiful areas of discrete mathematical structures with examples in logic, applications of the principle of inclusion and exclusion and finally the pigeonhole principal.

Mathematics for Computer Scientists (Gareth J. Janacek, et al)
The aim of this book is to present some the basic mathematics that is needed by computer scientists. The reader is not expected to be a mathematician and we hope will find what follows useful.
:






















