Hypha

hypha

Lecture 16: Counting Techniques

1:15:13 Free

This lecture continues the topic of counting and looks at how product rules can be used with cards as an example.

Source: Zachary Abel, Mathematics for Computer Science (MIT: OpenCourseWare). Licensed under CC BY-NC-SA 4.0.

Hypha Official

Watch what matters. Create what pays.

MIT 6.1200J: Mathematics for Computer Science

This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, recurrences, asymptotic notation, elementary analysis of algorithms, elementary number theory and cryptography, permutations and combinations, counting tools, and discrete probability.