You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
You must be logged in to perform this action.
- Author:
-
Dijk, Marten van,
Leighton, Tom
- Subject:
- Mathematics and Statistics, Science and Technology
- Institution Name:
- M.I.T.
- Collection:
-
MIT OpenCourseWare
- Grade Level:
- Post-secondary
- Abstract:
This course covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.
- Languages:
- English
- Material Type:
- Assessments, Homework and Assignments, Readings, Syllabi
- Media Format:
- Text/HTML, Downloadable docs
- Conditions of Use:
-
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Remix and Share
No restrictions on your remixing, redistributing, or making derivative works.
Give credit to the author, as required.
Your remixing, redistributing, or making derivatives works comes with some
restrictions, including how it is shared.
Your redistributing comes with some restrictions. Do not remix or make
derivative works.
Copyrighted materials, available under Fair Use and the TEACH Act for US-based
educators, or other custom arrangements. Go to the resource provider to see
their individual restrictions.
Comments