# 2009 UNCO Math Contest II Problems/Problem 10

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

## Problem

Let $S=\left \{1,2,3,\ldots ,n\right \}$. Determine the number of subsets $A$ of $S$ such that $A$ contains at least two elements and such that no two elements of $A$ differ by $1$ when

(a) $n=10$

(b) $n=20$

(c) generalize for any $n$.