What is the least number n with the property that, in every group of n people, there are at least three people who are all frien
1 answer:
Answer:
hello your question is incomplete attached below is a the complete question
answer : n = 5
Step-by-step explanation:
lets consider N to be 5
To prove that the least number 'n' = 5
we will represent this information in a graph as vertex
Black edge = Friends
Blue edge = not Friends
From the attached diagram any vertex contains 0,1,2,3,4 black lines and 4,3,2,1,0 blue lines
attached below is an explanation related to the choice of n = 5
considering n = 5 is satisfied by the explanation given
You might be interested in
Answer:
A=4000, B=80, C=24
Step-by-step explanation:
You forgot to put the correct area model, I attached it to the answer.
We have the fact that Mountain Q is 4 times the height of Mountain P. That's the "4" we have in the left side of our model. It's like having a multiplication table, next to the "4" we have "A" and upper this we have "1000", the only thing we have to do is multiplify 4*1000=4000. The next letter we have is B and below it we have "320", we divided it by 4, 320/4=80. The last letter we have is C, and is below a "6", we only have to multiplify it by 4, 6*4=24.
At the end we only sum our
- A + 320 + c = 4344 (4 times the height of Mountain P).
- 1000 + B + 6 = 1086(the height of the Mountain P).
