Title of Books : A First Course in Discrete Mathematics

Author : Ian Anderson

Publisher :Department of Mathematics, University of Glasgow, University Gardens, Glasgow G12 8QW, UK

Year Published : 2002

Code Book : 1-85233-326-0

This addition to the SUMS series of textbooks is an introduction to various aspect of discrete mathematics. It is intend as a text book which could be used at undergraduate level, probably in the second year of an English undergraduate mathematics course.

Some text books on discrete mathematics are written primarily for computing science students, but the present book is intendend for student following a mathematics course.

The place of discrete mathematics in the undergraduate curriculum is now fairly well established, and it is certain that its place in the curriculum will be maintained in the third millenium.

Discrete mathematics has saveral aspect. one fundamental part is enumeration, the study of counting arrangements of various types.

We might count the number of ways of choosing six lottery numbers from, 1,2, ..., 49 or the number of spanning trees in a complete grap, or the number of ways of arranging 16 teams into four group.

We develop methods of counting which can deal with such problems.

This addition to the SUMS series of textbooks is an introduction to various aspect of discrete mathematics. It is intend as a text book which could be used at undergraduate level, probably in the second year of an English undergraduate mathematics course.

Some text books on discrete mathematics are written primarily for computing science students, but the present book is intendend for student following a mathematics course.

The place of discrete mathematics in the undergraduate curriculum is now fairly well established, and it is certain that its place in the curriculum will be maintained in the third millenium.

Discrete mathematics has saveral aspect. one fundamental part is enumeration, the study of counting arrangements of various types.

We might count the number of ways of choosing six lottery numbers from, 1,2, ..., 49 or the number of spanning trees in a complete grap, or the number of ways of arranging 16 teams into four group.

We develop methods of counting which can deal with such problems.

**[ Download ]**

***Before / After Download, Please Your Comment Thanks**

## 0 Comments:

## Post a Comment