Discrete Mathematics

TRAMA

The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, logical framework, natural numbers, and the integers, in addition to updated chapters from the previous edition. Carefully structured, coherent and comprehensive, each chapter contains tailored exercises and solutions to selected questions, and miscellaneous exercises are presented throughout. This is an invaluable text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory and abstract algebra.

NOTE EDITORE

Biggs' Discrete Mathematics has been a best-selling textbook since the first and revised editions were published in 1986 and 1990, respectively. This second edition has been developed in response to undergraduate course changes and changes in students' needs. New to this edition are chapters on statements and proof, logical framework, and natural numbers and the integers, in addition to updated chapters from the previous edition. The new chapters are presented at a level suitable for mathematics and computer science students seeking a first approach to this broad and highly relevant topic. Each chapter contains newly developed tailored exercises, and miscellaneous exercises are presented throughout, providing the student with over 1000 individual tailored exercises. This edition is accompanied by a website www.oup.com/mathematics/discretemath containing hints and solutions to all exercises presented in the text, providing an invaluable resource for students and lecturers alike. The book is carefully structured, coherent and comprehensive, and is the ideal text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory, coding theory and abstract algebra.

SOMMARIO

1 - Statements and proofs2 - Set notation3 - The logical framework4 - Natural numbers5 - Functions6 - How to count7 - Integers8 - Divisibility and prime numbers9 - Fractions and real numbers10 - Principles of counting11 - Subsets and designs12 - Partition, classification and distribution13 - Modular arithmetic14 - Algorithms and their efficiency15 - Graphs16 - Trees, sorting and searching17 - Bipartite graphs and matching problems18 - Digraphs, networks and flows19 - Recursive techniques20 - Groups21 - Groups of permutations22 - Rings, fields and polynomials23 - Finite fields and some applications24 - Error-correcting codes25 - Generating functions26 - Partitions of a positive integer27 - Symmetry and counting

ALTRE INFORMAZIONI

• Condizione: Nuovo
• ISBN: 9780198507178
• Dimensioni: 245 x 25.0 x 188 mm Ø 824 gr
• Formato: Brossura
• Illustration Notes: numerous figures
• Pagine Arabe: 442