Answer:
T=45m+23
Step-by-step explanation:
Using the Fundamental Counting Theorem, it is found that there are 416,520 ways to fill out a lottery ticket.
<h3>What is the Fundamental Counting Theorem?</h3>
It is a theorem that states that if there are n things, each with
ways to be done, each thing independent of the other, the number of ways they can be done is:
![N = n_1 \times n_2 \times \cdots \times n_n](https://tex.z-dn.net/?f=N%20%3D%20n_1%20%5Ctimes%20n_2%20%5Ctimes%20%5Ccdots%20%5Ctimes%20n_n)
In this problem:
- First, one uppercase or lowercase letter is chosen, there are 26 of each, hence
.
- Then, two different two-digit numbers are chosen, and there are 90 of them, hence
, as the third digit has to be different of the second.
Then:
![N = n_1n_2n_3 = 52(90)(89) = 416520](https://tex.z-dn.net/?f=N%20%3D%20n_1n_2n_3%20%3D%2052%2890%29%2889%29%20%3D%20416520)
There are 416,520 ways to fill out a lottery ticket.
To learn more about the Fundamental Counting Theorem, you can take a look at brainly.com/question/24314866
I DONT KNOW ESPONAL SO I CANT HELP SORRRRY
![here \: is \: ur \: answer....](https://tex.z-dn.net/?f=here%20%5C%3A%20is%20%5C%3A%20ur%20%5C%3A%20answer....)
Cam solved correctly....!
To solve this problem, we need to find for the LCM of each
number. That is:
12: 12, 24, 36, 48, 60
16: 16, 32, 48, 64, 80
So we can see that the LCM is 48.
<span>Therefore the least number of each color of marble must be
48.</span>