# Discrete Mathematics Using a Computer by John O'Donnell By John O'Donnell

Discrete arithmetic utilizing a Computer deals a brand new, ''hands-on'' method of educating Discrete arithmetic. utilizing software program that's freely on hand on Mac, laptop and Unix systems, the practical language Haskell permits scholars to scan with mathematical notations and ideas -- a realistic procedure that gives scholars with quick suggestions and permits teachers to watch development easily.

This moment version of the winning textbook comprises major extra fabric at the functions of formal tips on how to sensible programming difficulties. There are extra examples of induction proofs on small courses, in addition to a brand new bankruptcy displaying how a mathematical technique can be utilized to encourage AVL bushes, a tremendous and complicated info structure.

Designed for 1st and second yr undergraduate scholars, the booklet can be like minded for self-study. No past wisdom of useful programming is needed; every little thing the coed wishes is both supplied or may be picked up simply as they cross along.

Key beneficial properties include:

• Numerous workouts and examples
• A web content with software program instruments and extra perform difficulties, suggestions, and reasons, in addition to direction slides
• Suggestions for extra reading

Complete with an accompanying instructor's advisor, to be had through the net, this quantity is meant because the fundamental educating textual content for Discrete arithmetic classes, yet also will offer invaluable interpreting for Conversion Masters and Formal tools courses.

Visit the book’s website at: http://www.dcs.gla.ac.uk/~jtod/discrete-mathematics/

Read or Download Discrete Mathematics Using a Computer PDF

Similar discrete mathematics books

Complexity: Knots, Colourings and Countings

In line with lectures on the complicated examine Institute of Discrete utilized arithmetic in June 1991, those notes hyperlink algorithmic difficulties coming up in knot idea, statistical physics and classical combinatorics for researchers in discrete arithmetic, desktop technology and statistical physics.

Mathematical programming and game theory for decision making

This edited ebook offers fresh advancements and cutting-edge overview in a number of components of mathematical programming and video game idea. it's a peer-reviewed learn monograph below the ISI Platinum Jubilee sequence on Statistical technological know-how and Interdisciplinary learn. This quantity offers a wide ranging view of idea and the purposes of the tools of mathematical programming to difficulties in facts, finance, video games and electric networks.

Introduction to HOL: A Theorem-Proving Environment for Higher-Order Logic

HOL is an evidence improvement process meant for purposes to either and software program. it truly is largely utilized in methods: for without delay proving theorems, and as theorem-proving help for application-specific verification structures. HOL is at the moment being utilized to a wide selection of difficulties, together with the specification and verification of severe platforms.

Algebra und Diskrete Mathematik

Band 1 Grundbegriffe der Mathematik, Algebraische Strukturen 1, Lineare Algebra und Analytische Geometrie, Numerische Algebra. Band 2 Lineare Optimierung, Graphen und Algorithmen, Algebraische Strukturen und Allgemeine Algebra mit Anwendungen

Additional resources for Discrete Mathematics Using a Computer

Sample text

For example, suppose we are given the following deﬁnitions, which are written as equations: x = 8 y = 4 These equations are going to be cited as justiﬁcations for reasoning steps, so it helps to have a standard way to name equations. The notation { x } means “the equation that deﬁnes x”. Now, suppose the problem is to evaluate 2 ∗ x + x/y. We do this by writing a chain of expressions, each one equal to the previous, beginning with the original problem and ending with the ﬁnal result. Each step is justiﬁed by a reason given in braces { .

A function with a type variable in its type signature is said to be polymorphic, because its type can take many forms. Many important Haskell functions are polymorphic, enabling them to be used in a wide variety of circumstances. Polymorphism is a very important invention because it makes it easier to reuse programs. 8 Common Functions on Lists Haskell provides a number of operations on lists. A few of the most important ones are presented in this section. We will have more to say about these functions later in the book, where we will use them in a variety of practical applications, show how they are implemented, and prove theorems stating some of their mathematical properties.

Argn = expression that can use the arguments The function deﬁnition should be inserted in a Haskell script ﬁle. When you load the ﬁle, you will then be able to use your functions. For example, suppose we want a function square that takes an Integer and squares it. Here is the function deﬁnition: square :: Integer -> Integer square x = x*x When a function is applied to an argument, the value of the argument is available to the expression on the right-hand side of the function’s deﬁning equation.

Download PDF sample

Rated 4.47 of 5 – based on 47 votes