000 01990nam a2200217 a 4500
001 42426
003 0000000000
005 20240411193048.0
008 210713n s 000 0 eng d
020 _a978-1516921188
100 1 _aLevin, Oscar.
245 1 0 _aDiscrete mathematics :
_h[electronic resource]
_ban open Introduction /
_cOscar Levin.
260 _as.l. :
_bCreatespace,
_c2015.
300 _a1 online resources.
500 _a"Fall 2015"
520 _aNote: This is a custom edition of Levin's full Discrete Mathematics text, arranged specifically for use in a discrete math course for future elementary and middle school teachers. (It is NOT a new and updated edition of the main text.)This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this.Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs.While there are many fine discrete math textbooks available, this text has the following advantages: - It is written to be used in an inquiry rich course.- It is written to be used in a course for future math teachers.- It is open source, with low cost print editions and free electronic editions.
650 7 _aMathematics.
_2sears
856 _uhttps://drive.google.com/file/d/1posAy3ZFUfh7d95iPMlQtIEg2gx1-BlR/view?usp=sharing
999 _c12510
_d12510