Foundations in Mathematical Proof

Construct a direct proof for a combinatorial statement involving divisibility or set membership.

Apply proof by contradiction to establish impossibility results in combinatorics.

Apply strong induction to prove results where multiple prior cases are needed, such as in recurrence relations.

Select the most appropriate proof strategy for a given novel combinatorial claim.