6120a Discrete Mathematics And Proof For Computer Science Fix Jun 2026

"...therefore, by the principle of mathematical induction, the algorithm is guaranteed to find the shortest path in logarithmic time," Sarah concluded. "The proof has been verified by the 6120a toolchain."

a ≡ b (mod n) means n | (a - b) , i.e., a - b = n*k for some integer k. rewrite a congruence as a linear equation before algebraic manipulation. by the principle of mathematical induction

The syllabus and materials for the full version (6.1200 or formerly 6.042J) are available on Textbooks: Discrete Mathematics for Computer Science by the principle of mathematical induction