2009 UNCO Math Contest II Problems/Problem 10

Revision as of 21:29, 19 October 2014 by Timneh (talk | contribs) (See also)

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$.


Solution

See also

2009 UNCO Math Contest II (ProblemsAnswer KeyResources)
Preceded by
Problem 9
Followed by
Problem 11
1 2 3 4 5 6 7 8 9 10
All UNCO Math Contest Problems and Solutions