Using the Pigeon Hole Principle to Solve an Equilateral Triangle Points Problem

  • Thread starter Thread starter auk411
  • Start date Start date
  • Tags Tags
    Hole Principle
AI Thread Summary
The problem involves determining how many points can be placed within an equilateral triangle of side length 2, ensuring that no two points are within a distance of 1 from each other. The Pigeon Hole Principle is suggested as a method for solving this. It is proposed that dividing the triangle into four areas, each capable of holding only one point, could allow for a maximum of four points. A configuration demonstrating the placement of four points is necessary to validate this conclusion. The discussion highlights confusion regarding the calculations and the reasoning behind the proposed solution.
auk411
Messages
54
Reaction score
0

Homework Statement


How many points can be placed in an equilateral triangle where each side is of length 2 such that no 2 points are within 1 of each other?



Homework Equations


Need to use pigeon hole principle.

The Attempt at a Solution


I know that there are at least 3. Visually, if you sketch the triangle it looks like there will be a 4. However, I don't know how to prove this.
 
Physics news on Phys.org
auk411 said:
I know that there are at least 3. Visually, if you sketch the triangle it looks like there will be a 4. However, I don't know how to prove this.

divide the triangle in 4 area's that can only contain 1 point each
 
willem2 said:
divide the triangle in 4 area's that can only contain 1 point each

Yes. I'm asking how does one show this. I don't know how to show this. Someone who claims to have the right answer told me that we need to add root 3 over 2 plus root 3 over 6 to get about 1.3.

I am completely lost as to how this is an answer.
 
auk411 said:
Yes. I'm asking how does one show this. I don't know how to show this. Someone who claims to have the right answer told me that we need to add root 3 over 2 plus root 3 over 6 to get about 1.3.

I am completely lost as to how this is an answer.

Apparently they computed the distance from a corner to a center of the triangle, but this indeed not the answer.

If you can divide the triangle in 4 pieces, such that the maximum distance between 2 points in a single piece is 1, then there can be only a single point in each piece, so the maximum amount of points is 4. You then only have to give a configuration of 4 points to prove that 4 is indeed possible.
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Back
Top