Atnaujinkite slapukų nuostatas

Discrete Transition to Advanced Mathematics [Kietas viršelis]

3.80/5 (10 ratings by Goodreads)
  • Formatas: Hardback, 424 pages, aukštis x plotis x storis: 467x467x580 mm, weight: 962 g, Illustrations
  • Serija: Pure and Applied Undergraduate Texts
  • Išleidimo metai: 30-Mar-2009
  • Leidėjas: American Mathematical Society
  • ISBN-10: 0821847899
  • ISBN-13: 9780821847893
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 424 pages, aukštis x plotis x storis: 467x467x580 mm, weight: 962 g, Illustrations
  • Serija: Pure and Applied Undergraduate Texts
  • Išleidimo metai: 30-Mar-2009
  • Leidėjas: American Mathematical Society
  • ISBN-10: 0821847899
  • ISBN-13: 9780821847893
Kitos knygos pagal šią temą:
As the title indicates, this book is intended for courses aimed at bridging the gap between lower-level mathematics and advanced mathematics. The text provides a careful introduction to techniques for writing proofs and a logical development of topics based on intuitive understanding of concepts. The authors utilize a clear writing style and a wealth of examples to develop an understanding of discrete mathematics and critical thinking skills. While including many traditional topics, the text offers innovative material throughout. Surprising results are used to motivate the reader. The last three chapters address topics such as continued fractions, infinite arithmetic, and the interplay among Fibonacci numbers, Pascal's triangle, and the golden ratio, and may be used for independent reading assignments. The treatment of sequences may be used to introduce epsilon-delta proofs. The selection of topics provides flexibility for the instructor in a course designed to spark the interest of students through exciting material while preparing them for subsequent proof-based courses.
1 Sets and Logic
1(48)
1.1 Sets
1(7)
1.2 Set Operations
8(12)
1.3 Partitions
20(5)
1.4 Logic and Truth Tables
25(9)
1.5 Quantifiers
34(5)
1.6 Implications
39(10)
2 Proofs
49(28)
2.1 Proof Techniques
49(11)
2.2 Mathematical Induction
60(10)
2.3 The Pigeonhole Principle
70(7)
3 Number Theory
77(46)
3.1 Divisibility
77(10)
3.2 The Euclidean Algorithm
87(8)
3.3 The Fundamental Theorem of Arithmetic
95(7)
3.4 Divisibility Tests
102(9)
3.5 Number Patterns
111(12)
4 Combinatorics
123(40)
4.1 Getting from Point A to Point B
123(9)
4.2 The Fundamental Principle of Counting
132(9)
4.3 A Formula for the Binomial Coefficients
141(5)
4.4 Combinatorics with Indistinguishable Objects
146(9)
4.5 Probability
155(8)
5 Relations
163(34)
5.1 Relations
163(7)
5.2 Equivalence Relations
170(8)
5.3 Partial Orders
178(8)
5.4 Quotient Spaces
186(11)
6 Functions and Cardinality
197(34)
6.1 Functions
197(10)
6.2 Inverse Relations and Inverse Functions
207(8)
6.3 Cardinality of Infinite Sets
215(8)
6.4 An Order Relation for Cardinal Numbers
223(8)
7 Graph Theory
231(42)
7.1 Graphs
231(11)
7.2 Matrices, Digraphs, and Relations
242(11)
7.3 Shortest Paths in Weighted Graphs
253(10)
7.4 Trees
263(10)
8 Sequences
273(58)
8.1 Sequences
273(7)
8.2 Finite Differences
280(9)
8.3 Limits of Sequences of Real Numbers
289(8)
8.4 Some Convergence Properties
297(6)
8.5 Infinite Arithmetic
303(13)
8.6 Recurrence Relations
316(15)
9 Fibonacci Numbers and Pascal's Triangle
331(46)
9.1 Pascal's Triangle
331(13)
9.2 The Fibonacci Numbers
344(11)
9.3 The Golden Ratio
355(7)
9.4 Fibonacci Numbers and the Golden Ratio
362(8)
9.5 Pascal's Triangle and the Fibonacci Numbers
370(7)
10 Continued Fractions
377(32)
10.1 Finite Continued Fractions
377(8)
10.2 Convergents of a Continued Fraction
385(7)
10.3 Infinite Continued Fractions
392(6)
10.4 Applications of Continued Fractions
398(11)
Answers or Hints for Selected Exercises 409(10)
Bibliography 419(2)
Index 421