Discrete Mathematics ( Modular Mathematics Series )

Publication series :Modular Mathematics Series

Author: Chetwynd   Amanda;Diggle   Peter  

Publisher: Elsevier Science‎

Publication year: 1995

E-ISBN: 9780080928609

P-ISBN(Paperback): 9780340610473

Subject: TP301.6 algorithm theory

Keyword: 数学

Language: ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Description

As an introduction to discrete mathematics, this text provides a straightforward overview of the range of mathematical techniques available to students. Assuming very little prior knowledge, and with the minimum of technical complication, it gives an account of the foundations of modern mathematics: logic; sets; relations and functions. It then develops these ideas in the context of three particular topics: combinatorics (the mathematics of counting); probability (the mathematics of chance) and graph theory (the mathematics of connections in networks).

Worked examples and graded exercises are used throughout to develop ideas and concepts. The format of this book is such that it can be easily used as the basis for a complete modular course in discrete mathematics.

The users who browse this book also browse


No browse record.