I was wondering what the answer to these problems is?
2 answers:
You might be interested in
Answer:
Step-by-step explanation:
→ First look at the first term of each expression and see if they can be simplified, and they can
→ Now look at the a terms, since a larger one is at the top, you subtract
→ Now simplify the b and c terms
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.