# MIT 6.042J Mathematics for Computer Science, Spring 2015

View the complete course: http://ocw.mit.edu/6-042JS15 Instructor: Albert R. Meyer 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. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

- Kind: Talk
- Year: 2015
- By: MIT OpenCourseWare
- Genres: Education, Science
- Archive: [Internet Archive](https://archive.org/details/MIT6.042JS15)
- Licence or status: [CC BY-NC-SA 3.0](http://creativecommons.org/licenses/by-nc-sa/3.0/) (as the archive states it)
- Who can watch: Tweens profiles and older (the archive gives no rating; placed by Invisible Network from its collection and subjects)

[Watch now](https://invisiblenetwork.ai/watch/archive/ia/MIT6.042JS15?play=1)