Solve by intersection graph Let S be a set of ‘Moumineen’ with six elements and ‘R:=Love’ be a relation on S such that for s, t ε S, sRt iff s loves t. Construct a graph G for (S, R) that has a vertex for each of the elements of S and has an edge connecting the two vertices representing the two elements if these elements are R-related. Hence find the number of edges in G for (S, R) if S has n elements.

33% of college students say they use credit cards because of the rewards program. you randomly select 10 college students and ask each to name the reason he or she uses credit cards. find the probability that the number of college students who say they use credit cards because of the rewards program is (a) exactly two, (b) more than two, and (c) between two and five inclusive. if convenient, use technology to find the probabilities.

Drag the tiles to the boxes to form correct pairs. not all tiles will be used. match each set of vertices with the type of quadrilateral they form.

Table which ratio is equivalent to 3: 7? 6: 7 3: 21 24: 56 15: 30