Think About the Process Ajar contains only pennies, nickels, dimes, and quarters. There are 22 pennies, 23 dimes, and 16 quarters. The rest of the coins are nickels. There are 82 coins in all. How
many of the coins are not nickels? If n represents the number of nickels in the jar, what equation
could you use to find n?

61 coins that are not nickels

n = 82 - 61

Step-by-step explanation:

22 pennies + 23 dimes + 16 quarters = 61 coins that are not nickels

n = no. of nickels

n = 82 - 61

< 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)