MAT243-Honors-Contract

Programming problems done for an honors contract for MAT 243 with Igor Fulman

Challenge problems in Chapter 1 of Discrete Mathematics and its Applications by Kenneth Rosen

1. Given the truth values of the propositions p and q, find the truth values of the conjunction, disjunction, exclusive or, conditional statement, and biconditional of these propositions.
2. Given two bit strings of length n, find the bitwise AND, bitwise OR, and bitwise XOR of these strings.
3. Give a compound proposition, determine whether it is satisfiable by checking its truth value for all positive assignments of truth values to its propositional variables.
4. Given the truth values of the propositions p and q in fuzzy logic, find the truth value of the disjunction and the conjunction of p and q
5. Given positive integers m and n, interactively play the game of Chomp.
6. Given a portion of a checkerboard, look for tilings of this checkerboard with various types of polyominoes, including dominoes, the two types of triominoes, and larger polyominoes.