Consider some 4-sided dice. roll two of these dice. let x be the minimum of the two values that appear. let y denote the maximum. let a j be the event containing all outcomes in which the minimum of the two dice is j or greater. let x j indicate whether a j occurs. then x = x 1 + x 2 + x 3 + x 4 .

120 seems like the most sensible answer.

step-by-step explanation:

if there is only one topping on all caramel apples and there's 120 of them. then all apples should/will be covered in sprinkles. make sense?

< xcy ≅ < xby

step-by-step explanation:

in δcax and δbax,

so, δcax ≅ δbax (side-angle-side or sas)

since δcax ≅ δbax, we can conclude < acx ≅ < abx

in δacy and δaby,

so, δacy ≅ δaby (side-angle-side or sas)

since δacy ≅ δaby, we can conclude < acy ≅ < aby

now,

< acy ≅ < aby

=> < acx + < xcy ≅ < abx + < xby

=> < acx + < xcy ≅ < acx + < xby   (since < acx ≅ < abx already proved above)

subtracting < acx from both sides, we get

< acx + < xcy -< acx ≅ < acx + < xby -< acx

cancelling out < acx and -< acx from both sides, we get

< xcy ≅ < xby (proved)

  answer:

  write 548 as 500 + 40 + 8. multiply each addend by 5. then add the three products to get 2,740.