Hypha

hypha

Lecture 9: Modular Arithmetic

1:19:45 Free

Modular arithmetic helps answer questions like: What is even+odd? What day of the week will it be 100 days from now? What computation do you need to do?

(rem(100, 2) = 2, so Tues+2=Thurs)

Source: Brynmor Chapman, 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.