For a positive integer n, let tn be the number of different ways to divide 2n people
Chapter 8, Problem 26(choose chapter or problem)
For a positive integer n, let tn be the number of different ways to divide 2n people into pairs to play n tennis matches. (a) Determine t1 and t2. (b) Give a recursive definition of tn for n 1. (c) Use the recursive definition in (b) to compute t3 and t4.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer