Difference between revisions of "2009 UNCO Math Contest II Problems/Problem 10"

m (See also)
(Solution)
Line 13: Line 13:
  
 
== Solution ==
 
== Solution ==
 +
{{solution}}
  
 
== See also ==
 
== See also ==

Revision as of 09:49, 26 November 2016

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

This problem needs a solution. If you have a solution for it, please help us out by adding it.

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
Invalid username
Login to AoPS