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...")
 
(Solution)
Line 18: Line 18:
  
 
== Solution ==
 
== Solution ==
 
+
{{solution}}
  
 
== See Also ==
 
== See Also ==

Revision as of 15:34, 26 November 2016

Problem

Let $f(n,2)$ be the number of ways of splitting $2n$ people into $n$ groups, each of size $2$. As an example,

the $4$ people $A, B, C, D$ can be split into $3$ groups: $\fbox{AB} \ \fbox{CD} ; \fbox{AC} \ \fbox{BD} ;$ and $\fbox{AD} \ \fbox{BC}.$

Hence $f(2,2)= 3.$

(a) Compute $f(3,2)$ and $f(4,2).$

(b) Conjecture a formula for $f(n,2).$

(c) Let $f(n,3)$ be the number of ways of splitting $\left \{1, 2, 3,\ldots ,3n \right \}$ into $n$ subsets of size $3$. Compute $f(2,3),f(3,3)$ and conjecture a formula for $f(n,3).$


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 (ProblemsAnswer KeyResources)
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