At a dance party there are 100 men and 20 women. for each i from 1,2, , 100, the ith man selects a group of a, women as potential dance partners (his "dance list," if you will), but in such a way that given any group of 20 men, it is always possible to pair the 20 men with the 20 women, with each man paired with a woman on his dance list. what is the smallest sum al + a2 + + awo for which there is a selection of dance lists that will guarantee this?

i pretty sure it is

c

step-by-step explanation:

alright so i think for this one it would to draw it out. this may be hard for me to try and draw, but i will do my best on here:

        r

  /       |     \

notice how it forms 2 triangles inside one bigger triangle.

so if we know the angle spr is the same as psr that is saying the measure of angle p is the same as angle s. this means the big triangle psr is either isosceles or equilateral. in both cases, the triangle is perfectly symmetrical when split down the middle, which is in this case rq. because we know it is perfectly symmetrical on both sides, we know that the two triangles inside the bigger one are equal.