Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

Tomas.A

How to prove that in group of 6 people there are at least 2 people who has same amount of friends among that group?

  • 2 years ago
  • 2 years ago

  • This Question is Closed
  1. rld613
    Best Response
    You've already chosen the best response.
    Medals 0

    LOL

    • 2 years ago
  2. Tomas.A
    Best Response
    You've already chosen the best response.
    Medals 2

    whats so lol

    • 2 years ago
  3. rld613
    Best Response
    You've already chosen the best response.
    Medals 0

    R u sure it cld be proved

    • 2 years ago
  4. Tomas.A
    Best Response
    You've already chosen the best response.
    Medals 2

    of course it is

    • 2 years ago
  5. rld613
    Best Response
    You've already chosen the best response.
    Medals 0

    oh i see didnt read the question correctly

    • 2 years ago
  6. Tomas.A
    Best Response
    You've already chosen the best response.
    Medals 2

    it's classical problem and i have proved it somehow but i don't remember anymore

    • 2 years ago
  7. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    do the 6 people even have to be friends? after all, a group of 6 strangers is still a group of 6

    • 2 years ago
  8. Tomas.A
    Best Response
    You've already chosen the best response.
    Medals 2

    no, but if they don't have any friends there will be 6 people who have no friends

    • 2 years ago
  9. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    if 2 people in the group are friends; then at least 2 people have 1 friend .... something like that

    • 2 years ago
  10. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    if 3 people are friends, then a > bc, b > ac, c>ba

    • 2 years ago
  11. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    thats at least 2 with the same amount of friends

    • 2 years ago
  12. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    or even a>c , c>b, c>ab

    • 2 years ago
  13. Tomas.A
    Best Response
    You've already chosen the best response.
    Medals 2

    well i translated it from lithuanian but it seems it has same meaning

    • 2 years ago
  14. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    can 2 people be not friends? if one of them is a friend?

    • 2 years ago
  15. JamesJ
    Best Response
    You've already chosen the best response.
    Medals 2

    oh wait, I see. Let f(n) be the number of friends in that group that the nth person has. For each n, \[ 0 \leq f(n) \leq 5 \] Therefore ...

    • 2 years ago
  16. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    a>c, b>c , c>ab is what i meant lol

    • 2 years ago
  17. Tomas.A
    Best Response
    You've already chosen the best response.
    Medals 2

    yes there can be no friends at all or 1 person can have no friends

    • 2 years ago
  18. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    I think James has it :)

    • 2 years ago
  19. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    even if 4 are friends, that still leaves 2 with 0 friends each which is the same amount

    • 2 years ago
  20. JamesJ
    Best Response
    You've already chosen the best response.
    Medals 2

    there are 6 values for f(1), f(2), f(3), f(4), f(5), f(6). Now it can't be that these six number take on all of 0,1,2,3,4,5. Because if f(n) = 5 for one n, then f(j) > 0 for all other \( j \neq n \). Hence in fact, there are only 5 possible values for f(n). But as there are six f(n), at least two of the f(n) must be equal.

    • 2 years ago
  21. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    ill concede to that answer as well ;)

    • 2 years ago
  22. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    my by case proof could get lengthy

    • 2 years ago
  23. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    gotta hang it on the left to be a valid q lol

    • 2 years ago
  24. amistre64
    Best Response
    You've already chosen the best response.
    Medals 0

    and I gotta get my ode hw written up so ciao yall :)

    • 2 years ago
    • Attachments:

See more questions >>>

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.