- Page 1:
Discrete Mathematics An Open Introd
- Page 4 and 5:
Oscar Levin School of Mathematical
- Page 7 and 8:
Acknowledgements This book would no
- Page 9 and 10:
Preface This text aims to give an i
- Page 11 and 12:
How to use this book In addition to
- Page 13 and 14:
Contents Acknowledgements Preface H
- Page 15 and 16:
Contents xiii Proof by Cases . . .
- Page 17 and 18:
Chapter 0 Introduction and Prelimin
- Page 19 and 20:
0.1. What is Discrete Mathematics?
- Page 21 and 22:
0.2. Mathematical Statements 5 •
- Page 23 and 24:
0.2. Mathematical Statements 7 Impl
- Page 25 and 26:
0.2. Mathematical Statements 9 3. I
- Page 27 and 28:
0.2. Mathematical Statements 11 The
- Page 29 and 30:
0.2. Mathematical Statements 13 It
- Page 31 and 32:
0.2. Mathematical Statements 15 Inv
- Page 33 and 34:
0.2. Mathematical Statements 17 and
- Page 35 and 36:
0.2. Mathematical Statements 19 7.
- Page 37 and 38:
0.2. Mathematical Statements 21 12.
- Page 39 and 40:
0.2. Mathematical Statements 23 (b)
- Page 41 and 42:
0.3. Sets 25 say that the set B is
- Page 43 and 44:
0.3. Sets 27 We already have a lot
- Page 45 and 46:
0.3. Sets 29 Example 0.3.3 Let A {
- Page 47 and 48:
0.3. Sets 31 Operations On Sets Is
- Page 49 and 50:
0.3. Sets 33 You might notice that
- Page 51 and 52:
0.3. Sets 35 Exercises 1. Let A {1
- Page 53 and 54:
0.3. Sets 37 17. Let A {a, b, c, d
- Page 55 and 56:
0.4. Functions 39 0.4 Functions A f
- Page 57 and 58:
0.4. Functions 41 It would be absol
- Page 59 and 60:
0.4. Functions 43 We will also be i
- Page 61 and 62:
0.4. Functions 45 2. We are told th
- Page 63 and 64:
0.4. Functions 47 2. g : {1, 2, 3}
- Page 65 and 66:
0.4. Functions 49 Example 0.4.8 Con
- Page 67 and 68:
0.4. Functions 51 Exercises 1. Cons
- Page 69 and 70:
0.4. Functions 53 10. Suppose f : N
- Page 71 and 72:
0.4. Functions 55 (c) f is bijectiv
- Page 73 and 74:
Chapter 1 Counting One of the first
- Page 75 and 76: 1.1. Additive and Multiplicative Pr
- Page 77 and 78: 1.1. Additive and Multiplicative Pr
- Page 79 and 80: 1.1. Additive and Multiplicative Pr
- Page 81 and 82: 1.1. Additive and Multiplicative Pr
- Page 83 and 84: 1.1. Additive and Multiplicative Pr
- Page 85 and 86: 1.1. Additive and Multiplicative Pr
- Page 87 and 88: 1.2. Binomial Coefficients 71 Of th
- Page 89 and 90: 1.2. Binomial Coefficients 73 probl
- Page 91 and 92: 1.2. Binomial Coefficients 75 In fa
- Page 93 and 94: 1.2. Binomial Coefficients 77 Remem
- Page 95 and 96: 1.2. Binomial Coefficients 79 3. Le
- Page 97 and 98: 1.3. Combinations and Permutations
- Page 99 and 100: 1.3. Combinations and Permutations
- Page 101 and 102: 1.3. Combinations and Permutations
- Page 103 and 104: 1.3. Combinations and Permutations
- Page 105 and 106: 1.4. Combinatorial Proofs 89 Invest
- Page 107 and 108: 1.4. Combinatorial Proofs 91 Soluti
- Page 109 and 110: 1.4. Combinatorial Proofs 93 Exampl
- Page 111 and 112: 1.4. Combinatorial Proofs 95 More P
- Page 113 and 114: 1.4. Combinatorial Proofs 97 Since
- Page 115 and 116: 1.4. Combinatorial Proofs 99 to (n,
- Page 117 and 118: 1.4. Combinatorial Proofs 101 8. Co
- Page 119 and 120: 1.5. Stars and Bars 103 Investigate
- Page 121 and 122: 1.5. Stars and Bars 105 some stars
- Page 123 and 124: 1.5. Stars and Bars 107 Example 1.5
- Page 125: 1.5. Stars and Bars 109 (b) How man
- Page 129 and 130: 1.6. Advanced Counting Using PIE 11
- Page 131 and 132: 1.6. Advanced Counting Using PIE 11
- Page 133 and 134: 1.6. Advanced Counting Using PIE 11
- Page 135 and 136: 1.6. Advanced Counting Using PIE 11
- Page 137 and 138: 1.6. Advanced Counting Using PIE 12
- Page 139 and 140: 1.6. Advanced Counting Using PIE 12
- Page 141 and 142: 1.6. Advanced Counting Using PIE 12
- Page 143 and 144: 1.7. Chapter Summary 127 Investigat
- Page 145 and 146: 1.7. Chapter Summary 129 (c) The pr
- Page 147 and 148: 1.7. Chapter Summary 131 (b) How ma
- Page 149 and 150: 1.7. Chapter Summary 133 one could
- Page 151 and 152: Chapter 2 Sequences Investigate! Th
- Page 153 and 154: 2.1. Describing Sequences 137 While
- Page 155 and 156: 2.1. Describing Sequences 139 You m
- Page 157 and 158: 2.1. Describing Sequences 141 5. (
- Page 159 and 160: 2.1. Describing Sequences 143 and s
- Page 161 and 162: 2.1. Describing Sequences 145 5. Th
- Page 163 and 164: 2.1. Describing Sequences 147 18. W
- Page 165 and 166: 2.2. Arithmetic and Geometric Seque
- Page 167 and 168: 2.2. Arithmetic and Geometric Seque
- Page 169 and 170: 2.2. Arithmetic and Geometric Seque
- Page 171 and 172: 2.2. Arithmetic and Geometric Seque
- Page 173 and 174: 2.2. Arithmetic and Geometric Seque
- Page 175 and 176: 2.2. Arithmetic and Geometric Seque
- Page 177 and 178:
2.3. Polynomial Fitting 161 sequenc
- Page 179 and 180:
2.3. Polynomial Fitting 163 a 2 7
- Page 181 and 182:
2.3. Polynomial Fitting 165 5. Make
- Page 183 and 184:
2.4. Solving Recurrence Relations 1
- Page 185 and 186:
2.4. Solving Recurrence Relations 1
- Page 187 and 188:
2.4. Solving Recurrence Relations 1
- Page 189 and 190:
2.4. Solving Recurrence Relations 1
- Page 191 and 192:
2.4. Solving Recurrence Relations 1
- Page 193 and 194:
2.5. Induction 177 2.5 Induction Ma
- Page 195 and 196:
2.5. Induction 179 2. Prove that if
- Page 197 and 198:
2.5. Induction 181 the next is easi
- Page 199 and 200:
2.5. Induction 183 But we want to k
- Page 201 and 202:
2.5. Induction 185 Investigate! Str
- Page 203 and 204:
2.5. Induction 187 a − 1 breaks;
- Page 205 and 206:
2.5. Induction 189 8. Zombie Euler
- Page 207 and 208:
23. Use induction to prove that 2.5
- Page 209 and 210:
2.6. Chapter Summary 193 Investigat
- Page 211 and 212:
2.6. Chapter Summary 195 (c) Find a
- Page 213 and 214:
Chapter 3 Symbolic Logic and Proofs
- Page 215 and 216:
3.1. Propositional Logic 199 Truth
- Page 217 and 218:
3.1. Propositional Logic 201 statem
- Page 219 and 220:
3.1. Propositional Logic 203 propos
- Page 221 and 222:
3.1. Propositional Logic 205 How do
- Page 223 and 224:
3.1. Propositional Logic 207 Beyond
- Page 225 and 226:
3.1. Propositional Logic 209 Exerci
- Page 227 and 228:
3.1. Propositional Logic 211 ∴ P
- Page 229 and 230:
3.2. Proofs 213 Investigate! 3.2 Pr
- Page 231 and 232:
3.2. Proofs 215 5. N is not divisib
- Page 233 and 234:
3.2. Proofs 217 to prove directly,
- Page 235 and 236:
3.2. Proofs 219 Example 3.2.7 Prove
- Page 237 and 238:
3.2. Proofs 221 In fact, we can qui
- Page 239 and 240:
3.2. Proofs 223 Exercises 1. Consid
- Page 241 and 242:
3.2. Proofs 225 14. Prove that ther
- Page 243 and 244:
3.3. Chapter Summary 227 3.3 Chapte
- Page 245 and 246:
3.3. Chapter Summary 229 6. Conside
- Page 247 and 248:
Chapter 4 Graph Theory Investigate!
- Page 249 and 250:
4.1. Definitions 233 Investigate! 4
- Page 251 and 252:
4.1. Definitions 235 we have edges
- Page 253 and 254:
4.1. Definitions 237 Alternatively,
- Page 255 and 256:
4.1. Definitions 239 2-element subs
- Page 257 and 258:
4.1. Definitions 241 the vertices w
- Page 259 and 260:
4.1. Definitions 243 Path A path is
- Page 261 and 262:
4.1. Definitions 245 9. For each of
- Page 263 and 264:
4.2. Trees 247 Investigate! 4.2 Tre
- Page 265 and 266:
4.2. Trees 249 Assume T is a tree,
- Page 267 and 268:
4.2. Trees 251 one. Let T ′ be th
- Page 269 and 270:
4.2. Trees 253 are adjacent (they a
- Page 271 and 272:
4.2. Trees 255 Exercises 1. Which o
- Page 273 and 274:
4.2. Trees 257 a d b c f e 14. Give
- Page 275 and 276:
4.3. Planar Graphs 259 WARNING: you
- Page 277 and 278:
4.3. Planar Graphs 261 which says t
- Page 279 and 280:
4.3. Planar Graphs 263 sphere to li
- Page 281 and 282:
4.3. Planar Graphs 265 which will b
- Page 283 and 284:
4.4. Coloring 267 Investigate! 4.4
- Page 285 and 286:
4.4. Coloring 269 representations o
- Page 287 and 288:
4.4. Coloring 271 KQEJ KQEA KQEB P
- Page 289 and 290:
4.4. Coloring 273 We must color the
- Page 291 and 292:
4.4. Coloring 275 6. Prove the chro
- Page 293 and 294:
4.5. Euler Paths and Circuits 277 I
- Page 295 and 296:
4.5. Euler Paths and Circuits 279 W
- Page 297 and 298:
4.5. Euler Paths and Circuits 281 (
- Page 299 and 300:
4.6. Matching in Bipartite Graphs 2
- Page 301 and 302:
4.6. Matching in Bipartite Graphs 2
- Page 303 and 304:
4.6. Matching in Bipartite Graphs 2
- Page 305 and 306:
4.7. Chapter Summary 289 4.7 Chapte
- Page 307 and 308:
4.7. Chapter Summary 291 (b) For wh
- Page 309 and 310:
4.7. Chapter Summary 293 (d) Every
- Page 311 and 312:
Chapter 5 Additional Topics 5.1 Gen
- Page 313 and 314:
5.1. Generating Functions 297 shift
- Page 315 and 316:
5.1. Generating Functions 299 numbe
- Page 317 and 318:
5.1. Generating Functions 301 relat
- Page 319 and 320:
5.1. Generating Functions 303 and t
- Page 321 and 322:
5.1. Generating Functions 305 7. Us
- Page 323 and 324:
5.2. Introduction to Number Theory
- Page 325 and 326:
5.2. Introduction to Number Theory
- Page 327 and 328:
5.2. Introduction to Number Theory
- Page 329 and 330:
5.2. Introduction to Number Theory
- Page 331 and 332:
5.2. Introduction to Number Theory
- Page 333 and 334:
5.2. Introduction to Number Theory
- Page 335 and 336:
5.2. Introduction to Number Theory
- Page 337 and 338:
5.2. Introduction to Number Theory
- Page 339 and 340:
5.2. Introduction to Number Theory
- Page 341 and 342:
Appendix A Selected Hints 0.2 Exerc
- Page 343 and 344:
Selected Hints 327 1.6 Exercises 1.
- Page 345 and 346:
Selected Hints 329 2.5.27. For the
- Page 347 and 348:
Selected Hints 331 3.2.16. Your fri
- Page 349 and 350:
Selected Hints 333 4.4.10. The chro
- Page 351 and 352:
Appendix B Selected Solutions 0.2.1
- Page 353 and 354:
Selected Solutions 337 (d) Equivale
- Page 355 and 356:
Selected Solutions 339 (b) We get t
- Page 357 and 358:
Selected Solutions 341 (d) Such an
- Page 359 and 360:
Selected Solutions 343 Proof. Let x
- Page 361 and 362:
Selected Solutions 345 (c) 2 6 −
- Page 363 and 364:
Selected Solutions 347 (c) To build
- Page 365 and 366:
Selected Solutions 349 the box. The
- Page 367 and 368:
Selected Solutions 351 (c) ( 16) [(
- Page 369 and 370:
Selected Solutions 353 (p) Neither.
- Page 371 and 372:
Selected Solutions 355 x + y n. So
- Page 373 and 374:
Selected Solutions 357 2.1.4. (a) T
- Page 375 and 376:
Selected Solutions 359 (b) 6n + 1,
- Page 377 and 378:
Selected Solutions 361 2.4.12. We h
- Page 379 and 380:
Selected Solutions 363 F 2k+3 −
- Page 381 and 382:
Selected Solutions 365 2.6.7. (a) 4
- Page 383 and 384:
Selected Solutions 367 3.1.16. (a)
- Page 385 and 386:
Selected Solutions 369 P Q R P →
- Page 387 and 388:
Selected Solutions 371 (b) The conv
- Page 389 and 390:
Selected Solutions 373 (c) Not poss
- Page 391 and 392:
Selected Solutions 375 number of fa
- Page 393 and 394:
Selected Solutions 377 4.6 Exercise
- Page 395 and 396:
Selected Solutions 379 (b) Now addi
- Page 397 and 398:
Selected Solutions 381 4.7.21. (a)
- Page 399 and 400:
Selected Solutions 383 5.2.6. (a) 3
- Page 401 and 402:
Appendix C List of Symbols Symbol D
- Page 403 and 404:
Index additive principle, 57 adjace
- Page 405 and 406:
Index 389 Goldbach conjecture, 227
- Page 407 and 408:
Index 391 vs combination, 84, 123,
- Page 409 and 410:
Index 393 set difference, 34 vertex
- Page 411:
Colophon This book was authored in