. . . . . . . . "If (a and b) or (a and c) is false, so is a or (b and c).It also has rules for negations:not (a and b) = (not a) or (not b)In programming, it makes writing if statements much more clear.Discrete math, for me, went from boolean algebra, to proofs (forward, contrapositive, contradiction, and induction), to sets, operations, and functions.The only application for discrete math in programming is funct" .