MATH 1020Q Chapter Homework: Dating Service Problem
Document Summary
The dating service problem on page 71 states that there are 6 couples who have been recently divorced. These couples want the opportunity to socialize with other people of the opposite sex. The service is going to throw parties to bring the couples together, however, no person wants to be in the same room as their divorcee. Each couple needs to attend parties, but not the same one. The problem then asks what the fewest number of parties that can be held is. To start this problem i visualized the couples by using letters: I highlighted the letters to represent who used to be married. Letters with matching colors represent previously married partners. After much trial and error this was the solution i came up with: Party 1: a , b with l j i. Party 2: b , c with g k j. Party 3: c , d with h l k.
