Difference between revisions of "2009 UNCO Math Contest II Problems/Problem 10"
m (→See also) |
Mathisfun04 (talk | contribs) (→Solution) |
||
| Line 13: | Line 13: | ||
== Solution == | == Solution == | ||
| + | {{solution}} | ||
== See also == | == See also == | ||
Revision as of 08:49, 26 November 2016
Problem
Let 
. Determine the number of subsets 
of 
such that contains at least two
elements and such that no two elements of differ by 
when
(a) 
(b) 
(c) generalize for any 
.
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 (Problems • Answer Key • Resources) | ||
| 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 | ||
