Answer:
I believe the answer is 5 units. Because it shows the line's arrow at unit 5.
For this problem,we use the Fundamental Counting Principle. You know that there are 7 digits in a number. In this principle, you have to multiply the possible numbers for every digit. If the first number cannot be zero, then there are 9 possible numbers. So, the value for the first digit is 9. The second digit could be any number but less of 1 because it was used in the 1st digit. So, that would be 10 - 1 = 9. The third digit must be the value in the second digit less than 1. That would be 9 - 1 = 8. And so on and so forth. The solution would be:
9×9×8×7×6×5×4 = 544,320 7-digit numbers
Answer:
1
Step-by-step explanation:
Easy because whenever the exponent is 0 the answer must always be 1 then the exponent on the outside it would still be 1.
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.