Mouseion · Collection II · Source file held locally

Discrete Mathematics: An Open Introduction, 3rd edition

Oscar Levin

Adds combinatorics, sequences and graph theory with inquiry exercises to complement formal logic and linear algebra.

A question to carry into the reading

What assumptions make a counting argument valid, and can a counterexample expose a hidden dependency?

Chapter 1, Counting; try an Investigate activity before reading its solution.

Further reading: MA-OPEN-014 · MA-OPEN-015

These are curatorial comparisons, not evidence supporting a scientific claim.

Reading and source

An older edition selected deliberately for its reusable terms; link to the current fourth edition for comparison. Formula extraction is imperfect, so consult the PDF or accessible source HTML.

The selected historical edition or paper is preserved in its original PDF. Consult the edition and transmission notes below.

Open the PDF

Download the unchanged source file

Read at the original source

Edition, source and reuse

Edition: 3rd edition, fifth printing, 1/7/2021 as printed; 414-page tablet PDF, ISBN 978-1792901690

Rights: CC BY-SA 4.0 printed in the acquired PDF. The newer fourth edition adds NonCommercial; these terms must not be interchanged.

Rights/source reference 1 · Rights/source reference 2 · Rights/source reference 3

Discrete Mathematics: An Open Introduction, 3rd edition — Oscar Levin. 3rd edition, fifth printing, 1/7/2021 as printed; 414-page tablet PDF, ISBN 978-1792901690. Source: https://discrete.openmathbooks.org/dmoi3.html. Selected source bytes unchanged; HCR description and reading question are separate.

Review scope: Author page, version, 414-page parse, rendered copyright page and preface sampled; not every proof checked. Chapter 1 opening and counting examples also sampled.