Combinatorics Problem: Forming Coalitions with at least 5 Mandates

  • Thread starter Thread starter abcdef123
  • Start date Start date
  • Tags Tags
    Combinatorics
Click For Summary

Homework Help Overview

The problem involves combinatorial analysis related to forming coalitions among 7 political parties, where one party has 3 mandates and the others have 1 mandate each. The questions focus on determining the number of coalitions that can be formed with at least 5 mandates under different conditions.

Discussion Character

  • Exploratory, Conceptual clarification, Problem interpretation

Approaches and Questions Raised

  • Participants discuss calculating coalitions with and without the party that has 3 mandates and consider the efficiency of different methods. Questions arise regarding the interpretation of the second part of the problem, particularly the implications of the order in which parties join the coalition.

Discussion Status

Participants are actively engaging with the problem, with some clarifying their understanding of the requirements for both parts. There is recognition of the need to differentiate between the two parts of the question, and some guidance has been offered regarding the use of binomial coefficients for calculations.

Contextual Notes

Participants are navigating the constraints of the problem, including the specific conditions under which coalitions are formed and the implications of the order of joining parties. There is an acknowledgment of potential overcomplication in the initial approaches.

abcdef123
Messages
2
Reaction score
0

Homework Statement



There are 7 parties competing in the elections. One party has obtained 3 mandates, and the rest 6 have received one mandate each.
a) How many different coalitions with at least 5 mandates can be formed?
b) Assume that the parties are being called to join each other in a random order, and a coalition is declared ”complete“ as soon as it has at least 5 mandates. How many different coalitions can be formed this way?

Homework Equations





The Attempt at a Solution



For part a) I assume you could calculate the number of coalitions that can be formed with the party with 3 votes and without it. Which I can do, I think. But I don't think that's the most efficient way and would take a while to work out (or maybe I'm just doing it wrong). And that doesn't really help with b.

I'm not asking for the answer at all, just how I would go about tackling this sort of problem.
 
Physics news on Phys.org
For part (a), you have the right idea. It's also a really fast calculation as long as you know how to answer the question: I have n balls with the numbers 1,...,n on them in a bag. How many different ways can I remove k of them? The answer uses what's called binomial coefficients

For part (b), can you identify what the difference between it and part (a) is?
 
Yeah, I got part a, I was just overcomplicating it with something that didn't need to be done. I believe part b to mean you 'call' each party to join the coalition in turn, and if it is greater than or equal to 5, no more parties join.

So, if the parties are A, B, C, D, E, F and G, where A is the one with 3 mandates. You could have
ABC or BCDEA, but not ABCD or BCDEFG
 
For part (b), the question simply states

How many different coalitions can be formed this way?

Which doesn't matter what the order is. So ABCD is a possible coalition, as long as the calling order is B,C,D, then A. So what is a simple way to describe all the possible coalitions that can be formed like this
 

Similar threads

  • · Replies 2 ·
Replies
2
Views
3K
Replies
23
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
Replies
7
Views
3K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 25 ·
Replies
25
Views
3K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 4 ·
Replies
4
Views
2K