Not 100% positive, but I think that it’s
13
10
9
16
15
11
14
12
I hope this helps
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.
Answer:
Step-by-step explanation:
220/8=27.5
28 hours
Hello!
We can find out our answer by plugging in the point (1,1) to see which equation works.
y=1.4(1.2)≠1
y=1.2≠1
y=0.5+0.3≠1
y=0.2+1.2≠1
As you can see, none of these answers are correct. You could make the last equation true by switching 0.2 to -0.2. It may have been a typo, so I would say the best answer is D.
I hope this helps!
