The answer to your problem is 2.5.
Answer:
Step-by-step explanation:
Let us assume that if possible in the group of 101, each had a different number of friends. Then the no of friends 101 persons have 0,1,2,....100 only since number of friends are integers and non negative.
Say P has 100 friends then P has all other persons as friends. In this case, there cannot be any one who has 0 friend. So a contradiction. Hence proved
Part ii: EVen if instead of 101, say n people are there same proof follows as
if different number of friends then they would be 0,1,2...n-1
If one person has n-1 friends then there cannot be any one who does not have any friend.
Thus same proof follows.
Distance formula = sqrt[(x1 - x2)^2 + (y2-y1)^2]
D = sqrt[(1 + 2)^2 + (5 - 1)^2]
D = sqrt[3^2 + 4^2]
D = sqrt(9 + 16)
D = sqrt(25)
D = 5
