anonymous
  • anonymous
How to prove that in group of 6 people there are at least 2 people who has same amount of friends among that group?
Mathematics
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
katieb
  • katieb
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
anonymous
  • anonymous
LOL
anonymous
  • anonymous
whats so lol
anonymous
  • anonymous
R u sure it cld be proved

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
of course it is
anonymous
  • anonymous
oh i see didnt read the question correctly
anonymous
  • anonymous
it's classical problem and i have proved it somehow but i don't remember anymore
amistre64
  • amistre64
do the 6 people even have to be friends? after all, a group of 6 strangers is still a group of 6
anonymous
  • anonymous
no, but if they don't have any friends there will be 6 people who have no friends
amistre64
  • amistre64
if 2 people in the group are friends; then at least 2 people have 1 friend .... something like that
amistre64
  • amistre64
if 3 people are friends, then a > bc, b > ac, c>ba
amistre64
  • amistre64
thats at least 2 with the same amount of friends
amistre64
  • amistre64
or even a>c , c>b, c>ab
anonymous
  • anonymous
well i translated it from lithuanian but it seems it has same meaning
amistre64
  • amistre64
can 2 people be not friends? if one of them is a friend?
JamesJ
  • JamesJ
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 ...
amistre64
  • amistre64
a>c, b>c , c>ab is what i meant lol
anonymous
  • anonymous
yes there can be no friends at all or 1 person can have no friends
amistre64
  • amistre64
I think James has it :)
amistre64
  • amistre64
even if 4 are friends, that still leaves 2 with 0 friends each which is the same amount
JamesJ
  • JamesJ
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.
amistre64
  • amistre64
ill concede to that answer as well ;)
amistre64
  • amistre64
my by case proof could get lengthy
amistre64
  • amistre64
gotta hang it on the left to be a valid q lol
amistre64
  • amistre64
and I gotta get my ode hw written up so ciao yall :)

Looking for something else?

Not the answer you are looking for? Search for more explanations.