In this video, I walk through a sample discrete math (for computer science) final solving questions related to propositional/predicate logic, sets and functions, summation and series, number theory, and proofs.
**Check with your professor if you finish a proof with a concluding statement and/or a QED square**
Timecodes:
0:19 - Problem 1abc
2:34 - Problem 2abc
6:18 - Problem 3a
8:47 - Problem 3b
12:03 - Problem 4a
15:50 - Problem 4b
(4b can also prove subset of the other side)*
17:25 - Problem 5a
19:20 - Problem 5b
(5b can also be done using just inequality definitions without differentiation)*
21:14 - Problem 6ab
24:14 - Problem 7ab
27:42 - Problem 8ab
(8a can also be done by using arbitrary coefficients and factor out a)*
30:40 - Problem 9a
35:42 - Problem 9b
39:22 - Problem 10a
42:43 - Problem 10b
(Accidental variable switch at the end, keep it in m not k)*
Sources and other tidbits:
Discrete Math CS Final PDF: https://bit.ly/39MP8jq
Twitter - https://twitter.com/michaelmaths_
Instagram - https://www.instagram.com/michaelmaths_