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:
6m
Step-by-step explanation:
the side of first square = 3 m
area of first square = 3^2= 9 m^2
let the side of second square = x m
since diagonal of first square = x m as per the question
in a square each angle is 90 degree
therefore by applying pythagorus theorem ,
diagonal ^2 = side^2 + side ^2
diagonal^2 = 3^2+3^2=9+9
DIAGONAL= square root of 18
diagonal= 3 m = side of second square
therefore in second square ,
one angle is 90 degree , therefore by applying pythagorue theorem
diaqonal^2 = side ^2 + side ^2 = (3)^2 + ( 3
)^2
diagonal ^2 = 18 + 18
diagonal = square root of 36
therefore diagonal of second square is 6m
hope it helps you... please mark me as the brainliest..