Muutke küpsiste eelistusi

Mathematics: A Discrete Introduction International ed of 2nd revised ed [Pehme köide]

  • Formaat: Paperback / softback, 520 pages, kõrgus x laius x paksus: 229x185x25 mm, kaal: 863 g, Illustrations
  • Ilmumisaeg: 01-Jul-2005
  • Kirjastus: Brooks/Cole
  • ISBN-10: 049501866X
  • ISBN-13: 9780495018667
Teised raamatud teemal:
  • Pehme köide
  • Hind: 81,07 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 101,34 €
  • Säästad 20%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
  • Formaat: Paperback / softback, 520 pages, kõrgus x laius x paksus: 229x185x25 mm, kaal: 863 g, Illustrations
  • Ilmumisaeg: 01-Jul-2005
  • Kirjastus: Brooks/Cole
  • ISBN-10: 049501866X
  • ISBN-13: 9780495018667
Teised raamatud teemal:
This book has two primary objectives: It teaches students fundamental concepts in discrete mathematics (from counting to basic cryptography to graph theory), and it teaches students proof-writing skills. With a wealth of learning aids and a clear presentation, the book teaches students not only how to write proofs, but how to think clearly and present cases logically beyond this course. Overall, this book is an introduction to mathematics. In particular, it is an introduction to discrete mathematics. All of the material is directly applicable to computer science and engineering, but it is presented from a mathematician's perspective. While algorithms and analysis appear throughout, the emphasis is on mathematics. Students will learn that discrete mathematics is very useful, especially those whose interests lie in computer science and engineering, as well as those who plan to study probability, statistics, operations research, and other areas of applied mathematics.
1. FUNDAMENTALS. Joy. Definition. Theorem. Proof. Counterexample.
Boolean Algebra. Self Test.
2. COLLECTIONS. Lists. Factorial. Sets I:
Introduction, Subsets. Quantifiers. Sets II: Operations. Combinatorial Proof:
Two Examples. Self Test.
3. COUNTING AND RELATIONS. Relations. Equivalence
Relations. Partitions. Binomial Coefficients. Counting Multisets.
Inclusion-Exclusion. Self Test.
4. MORE PROOF. Contradiction. Smallest
Counterexample. Induction. Recurrence Relations. Self Test.
5. FUNCTIONS.
Functions. The Pigeonhole Principle. Composition. Permutations. Symmetry.
Assorted Notation. Self Test.
6. PROBABILITY. Sample Space. Events.
Conditional Probability and Independence. Random Variables. Expectation. Self
Test.
7. NUMBER THEORY. Dividing. Greatest Common Divisor. Modular
Arithmetic. The Chinese Remainder Theorem. Factoring. Self Test.
8. ALGEBRA.
Groups. Group Isomorphism. Subgroups. Fermat's Little Theorem. Public-Key
Cryptography I: Introduction. Public-Key Cryptography II: Rabin's Method.
Public-Key Cryptography III: RSA. Self Test.
9. GRAPHS. Graph Theory
Fundamentals. Subgraphs. Connection. Trees. Eulerian Graphs. Coloring. Planar
Graphs. Self Test.
10. PARTIALLY ORDERED SETS. Partially Ordered Sets
Fundamentals. Max and Min. Linear Orders. Linear Extensions. Dimension.
Lattices. Self Test. APPENDICES. Lots of Hints and Comments; Some Answers.
Solutions to Self Tests. Glossary. Fundamentals. Index.