I'm new to Discrete math, I've been working on this problem for near an hour and can't figure out the next steps. The problem is: Show that [¬p ∧(p ∨ q)] → q is a tautology.
Here is what I have so far.
≡ ¬[¬p ∧(p ∨ q)] ∨ q
≡ [p ∨ ¬(p ∨ q)] ∨ q
≡ [p ∨ (¬p ∨ ¬q)] ∨ q
≡ [(p ∨ ¬p) ∧ (p ∨ ¬q)] ∨ ...
In the context of combinatorial mathematics, stars and bars is a graphical aid for deriving certain combinatorial theorems. It was popularized by William Feller in his classic book on probability. It can be used to solve many simple counting problems, such as how many ways there are to put n indistinguishable balls into k distinguishable bins.
== Statements of theorems ==
The stars and bars method is often introduced specifically to prove the following two theorems of elementary combinatorics.
=== Theorem one ===
For any pair of positive integers n and k, the number of k-tuples of posi...
