Difference between revisions of "2008 UNCO Math Contest II Problems/Problem 10"
(Created page with "== Problem == Let <math>f(n,2)</math> be the number of ways of splitting <math>2n</math> people into <math>n</math> groups, each of size <math>2</math>. As an example, the <ma...") |
Mathisfun04 (talk | contribs) (→Solution) |
||
| Line 18: | Line 18: | ||
== Solution == | == Solution == | ||
| − | + | {{solution}} | |
== See Also == | == See Also == | ||
Revision as of 14:34, 26 November 2016
Problem
Let 
be the number of ways of splitting 
people into 
groups, each of size 
. As an example,
the 
people 
can be split into 
groups: 
and 
Hence 
(a) Compute 
and 
(b) Conjecture a formula for 
(c) Let 
be the number of ways of splitting 
into subsets of size .
Compute 
and conjecture a formula for 
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2008 UNCO Math Contest II (Problems • Answer Key • Resources) | ||
| Preceded by Problem 9 |
Followed by Last Question | |
| 1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 | ||
| All UNCO Math Contest Problems and Solutions | ||
