Question on proofs for a CS related class

  • Thread starter Thread starter Bensky
  • Start date Start date
  • Tags Tags
    Class Cs Proofs
Click For Summary
SUMMARY

The discussion centers on understanding mathematical proofs, specifically in the context of a homework problem involving six people in a room and the application of the pigeonhole principle. The student lacks experience with proofs and mathematical rigor, which are essential for completing the assignment. The solution involves analyzing relationships among the six individuals, focusing on one person and determining the existence of either three mutual acquaintances or three mutual strangers. The hints provided emphasize the importance of visualizing the problem and using logical reasoning to arrive at a proof.

PREREQUISITES
  • Basic understanding of mathematical proofs
  • Familiarity with the pigeonhole principle
  • Knowledge of graph theory concepts, particularly relationships
  • Ability to apply logical reasoning in problem-solving
NEXT STEPS
  • Study the concept of mathematical rigor in proofs
  • Learn more about the pigeonhole principle and its applications
  • Explore graph theory basics, focusing on relationships and connectivity
  • Practice writing proofs with examples from discrete mathematics
USEFUL FOR

Students in computer science or mathematics, particularly those new to proofs and discrete mathematics, as well as educators looking to enhance their teaching methods in these subjects.

Bensky
Messages
82
Reaction score
0

Homework Statement


As a background to this...I have no experience with proofs at all. I did not take a formal geometry class in high school (took a shortened summer course that gave a VERY brief overview of proofs) and have not gotten to discrete math in university, so I really do not know how to approach/write proofs.

At the top of my homework, it says: "For each problem solution, attempt to adhere to mathematical rigor. Proofs and arguments should be detailed and complete." I've never heard of mathematical rigor and after looking it up I still don't really know how to "conform" to it. Seems like it's some kind of standard for proofs.

Here is one of the questions for my HW:
"Six people enter a room. Either there are three people who know each other or there are three people who are strangers to each other.

Prove the above statement. Where does a variant of the pigeonhole principle come in?"

I don't quite know where to start - I looked up the pidgeonhole principle and didn't really understand how it applies to this problem. Maybe someone can point me in the right direction as to how to write a proof for this problem?

This HW is due Thursday at 11:59 PM EST, help before then is very appreciated.

Homework Equations


None that I know of.

The Attempt at a Solution



?
 
Physics news on Phys.org
Hint: Think of the 6 people sitting around a table. Focus on one of them, call him A. Since he sees 5 people, there must be three he either knows or doesn't know. (There coudn't be just two of each). Examine that situation a little further.
 
LCKurtz said:
Hint: Think of the 6 people sitting around a table. Focus on one of them, call him A. Since he sees 5 people, there must be three he either knows or doesn't know. (There coudn't be just two of each). Examine that situation a little further.

I'm still not quite understanding - isn't it possible that he doesn't know all 5 of them and is simply in the same room with random people? Do you mean "AT LEAST 3 he either knows or 3 he doesn't know?"
 
Bensky said:
I'm still not quite understanding - isn't it possible that he doesn't know all 5 of them and is simply in the same room with random people? Do you mean "AT LEAST 3 he either knows or 3 he doesn't know?"

Yes that's what I mean. So you can pick 3 to go with A. Analyze them; try drawing solid or dashed lines for know, don't know and see what happens.
 
Here's a hint:

If you know someone, then they know you.
 
i'll go with NOUSE post
 

Similar threads

  • · Replies 17 ·
Replies
17
Views
10K
  • · Replies 8 ·
Replies
8
Views
3K
  • · Replies 6 ·
Replies
6
Views
1K
  • Sticky
  • · Replies 0 ·
Replies
0
Views
3K
  • · Replies 10 ·
Replies
10
Views
844
  • · Replies 6 ·
Replies
6
Views
2K
  • · Replies 4 ·
Replies
4
Views
1K
  • · Replies 105 ·
4
Replies
105
Views
9K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K