A pizza parlor has a choice of 10 toppings for its pizzas. From these 10 toppings, how many different 7-topping pizzas are possible?

what are the choices?

Step-by-step explanation:

if there are none then i'll say 331

To solve for the number of different possible pizzas with 7 toppings out of 10 and the arrangement of these toppings is not important, therefore we use the combination formula.

The formula for combination is:

n C r = n! / r! (n – r)!

where,

n = is the total number of toppings = 10

r = the number of toppings in a pizza = 7

Substituting the values into the equation:

10 C 7 = 11! / 7! (11 – 7)!

10 C 7 = 11! / 7! * 4!

10 C 7 = 329

Therefore there are a total different 329 (or 330) pizzas with 7 different combinations toppings.

∠lno ≅ ∠lnm

∠oln ≅ ∠mln

step-by-step explanation:

given   that triangle lno is congruent to triangle lnm.

we have to fill up the blanks in the given question.

according to above order of congruency   kept in mind we can say that

∠lno ≅ ∠lnm

∠oln ≅ ∠mln

ln ≅ ln due to common in both.

hence, by sas congruency,

the side angle side rule   states that if two sides and the included angle of one triangle are congruent to another triangle, then these two triangles are congruent.

tube or goog would be a great resource to with that question