Hi!
<u>Given these two equations:</u>
We want to solve using the substitution method. Knowing that x is equal to y + 8, we can simply plug in 'y + 8' in for x in the second equation, like so:
Combine like terms on both sides:
Subtract y from both sides:
Subtract 8 from both sides:
Now, we can simply plug the y value in to the first equation, and solve for x:
Simplify:
<u>Learn more about the substitution (and also elimination!) method here:</u>
Answer:
438,012 ways.
Step-by-step explanation:
We have been given that each coupon code will have three letters followed by two digits. The letters M, N, and O and the digits 1, 3, 5, and 7 will not be used. So, there are 23 letters and 6 digits that will be used.
Since the letters and digits can be repeated, so we will use fundamental principal of counting.
For first place, we can use 23 letters, for 2nd and 3rd place we can use 23 letters.
We can use 6 digits for 1st digit place and 6 digit for 2nd digit place as repetition is allowed.
So we can choose coupon code is following ways:
Therefore, we can choose coupon codes in 438,012 ways.
