Discrete Mathematics, Logic, and Proof
Sets, Relations, Functions, and Counting
Describe discrete objects and count finite possibilities using clear mathematical structures.
0/6Articles read
0/18Latest correct answers
18Unanswered questions
0Due for review
Loading learning records…
Readings and practice
Sets, relations, and counting: handle overlap and correspondence
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Equivalence relations: define which objects count as the same
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Partial orders: allow incomparable pairs
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Injective and surjective functions: distinction versus coverage
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
The pigeonhole principle: count when collisions are unavoidable
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered
Graph connectivity: specify direction and reachability
Unread · Latest correct 0/3
Practise these questionsAnswer history and review dates
Question 1
Not yet answered
Question 2
Not yet answered
Question 3
Not yet answered