Can the Last Pigeon Group Enter Selected Holes if M of Them Must Be Empty?

  • Context: Undergrad 
  • Thread starter Thread starter mostaphaamini
  • Start date Start date
  • Tags Tags
    advanced Principle
Click For Summary

Discussion Overview

The discussion revolves around a combinatorial problem involving groups of pigeons and holes, specifically addressing whether the last group of pigeons can enter selected holes given certain constraints. The problem includes parameters such as the number of holes (K), groups of pigeons (N), pigeons per group (M), and the number of holes each group can select (Z). The focus is on the conditions under which the last group may be unable to enter due to prior selections filling the holes.

Discussion Character

  • Exploratory
  • Technical explanation
  • Debate/contested

Main Points Raised

  • Some participants interpret the problem as determining if all pigeons can fit into the holes based on the relationship between M, Z, and N.
  • Others argue that the specific holes selected by the groups are crucial, as the arrangement can affect whether the last group can enter.
  • A participant suggests that the problem may be solvable through a recursive routine, seeking a formula to clarify the conditions for entry.
  • Concerns are raised about the clarity of the problem statement, with some participants finding it difficult to understand the requirements and implications of the constraints.
  • Examples are provided to illustrate scenarios where the selection of holes impacts the ability of subsequent groups to enter, emphasizing the need for specific selection criteria.

Areas of Agreement / Disagreement

Participants generally agree that the selection of holes is a critical factor in determining whether the last group can enter, but there is no consensus on the exact conditions or a definitive solution to the problem. Multiple interpretations and approaches are presented, indicating ongoing disagreement and exploration of the topic.

Contextual Notes

Participants express uncertainty regarding the relationships between the variables and the implications of the problem's constraints. The discussion highlights the complexity of the situation and the need for clearer definitions and examples.

mostaphaamini
Messages
4
Reaction score
0
Hi all,
I have a question and hope to solve.
problem terms :
1- there are K holes.
2- there are N group of Pigeon.
3- there are M Pigeon in any Pigeon group.
4- each group of Pigeon can chose Z hole so that K >= Z >= M.
5- we don`t know which hole selected by a Pigeon only we know M Pigeon in group select Z hole.
6- the capacity of each hole is exact one Pigeon.
How we can determine last Pigeon group can not enter to the selected holes (because the selected hole are full)?
 
Physics news on Phys.org
The explanation is a bit unclear, but this is how I interpreted it:

There are K pigeonholes, N groups and M pigeons in each group. Z is a number between M and N, and is the number of holes each group occupies. The question is to determine if all pigeons can fit in the holes or not.

If that is so, then obviously, since each group occupies Z holes, and they all fit in, M*Z must be less than or equal to N. If M*Z is larger than N, the last group will not be able to choose Z holes. I can hardly see how this is a more complex situation than the classical pigeonhole principle, so I assume my interpretation is incorrect. Besides, what is the relevance of 6- if every group need Z holes each.
 
Jarle said:
The explanation is a bit unclear, but this is how I interpreted it:

There are K pigeonholes, N groups and M pigeons in each group. Z is a number between M and N, and is the number of holes each group occupies. The question is to determine if all pigeons can fit in the holes or not.

If that is so, then obviously, since each group occupies Z holes, and they all fit in, M*Z must be less than or equal to N. If M*Z is larger than N, the last group will not be able to choose Z holes. I can hardly see how this is a more complex situation than the classical pigeonhole principle, so I assume my interpretation is incorrect. Besides, what is the relevance of 6- if every group need Z holes each.

Jarle, read more carefully. Z is number between K and M or can be equal (term 4) no between N and M
this question is a bit hard and need more think
 
mostaphaamini said:
Jarle, read more carefully. Z is number between K and M or can be equal (term 4) no between N and M
this question is a bit hard and need more think

Yes, I meant between or equal to K or M. I confused a few variables. It should be (N/M)*Z, not M*Z. And this must be compared to K, not N. Explain how it matters how man pigeons that fit into a hole when all you know is that a group of M pigeons occupies Z holes?
 
Jarle said:
Yes, I meant between or equal to K or M. I confused a few variables. It should be (N/M)*Z, not M*Z. And this must be compared to K, not N. Explain how it matters how man pigeons that fit into a hole when all you know is that a group of M pigeons occupies Z holes?
I am sorry for my English
Let me for an example :
there is 4 holes, first pigeons group arrive and this group have 2 pigeons, pigeons select first and second holes now another group is coming and in the new group there is only one pigeon that select first hole, there are totally 3 pigeons and 4 holes and with your formula all must be true but in fact pigeons can not enter to holes because first hole selected by 2 pigeons now let's change the situation, first pigeons*group select first, second and third holes and now we have the answer because 2 pigeons in the first group can enter to holes 2 and 3 and pigeon in the second group can enter to hole 2. this problem will be solved by a recursive routine but I need a formula
this forum disappoint me I think it have many mathematician and I expect more reply
 
You can't expect a lot of replies when it's hard to figure out what you're asking. So the pigeons select Z holes that they are allowed to go into, and the requirement is that M of them are empty?

This is going to depend heavily on which Z holes the pigeons select... you can't answer it based only on M,N,Z and K.

As an example with two pigeons and two holes: M=1,Z=1, K=2, N=2:

First pigeon selects first hole. Second pigeon selects first hole. They fail to fit

First pigeon selects first hole. Second pigeon selects second hole. They fit.

What kind of criterion do you have for which holes the pigeons are allowed to select?
 
Office_Shredder said:
You can't expect a lot of replies when it's hard to figure out what you're asking. So the pigeons select Z holes that they are allowed to go into, and the requirement is that M of them are empty?

This is going to depend heavily on which Z holes the pigeons select... you can't answer it based only on M,N,Z and K.

As an example with two pigeons and two holes: M=1,Z=1, K=2, N=2:

First pigeon selects first hole. Second pigeon selects first hole. They fail to fit

First pigeon selects first hole. Second pigeon selects second hole. They fit.

What kind of criterion do you have for which holes the pigeons are allowed to select?

please think more higher, it is completely clear that holes capacity is exact one pigeon so when the first pigeon select a hole other pigeons of group must select another holes.
in the older post there is an example but more explain : we know any group of pigeons select Z holes from K holes and K >= Z >= M but we don`t know which hole are selected by pigeons so we can suppose if next group select one hole of previous group holes, pigeons of the previous group did not enter to this specific hole (if K > M and no K = M). this condition may be check every time that new group arrive for all older groups
 
It's not easy to understand the situation after the first reading..the pigeons select Z holes that they are allowed to go into, and the requirement is that M of them are empty..how can we predict? they are unpredictable))
 

Similar threads

  • · Replies 29 ·
Replies
29
Views
6K
Replies
4
Views
2K
  • · Replies 93 ·
4
Replies
93
Views
13K
  • · Replies 6 ·
Replies
6
Views
3K
  • · Replies 25 ·
Replies
25
Views
6K
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 1 ·
Replies
1
Views
4K
  • · Replies 38 ·
2
Replies
38
Views
9K
  • · Replies 13 ·
Replies
13
Views
13K
  • · Replies 26 ·
Replies
26
Views
6K