Answer:
I think that's right. I checked my answer and proved it on that sheet.
Answer:
For the code we have 3 selections.
The first selection is a digit that must be odd, so the options are {1, 3, 5, 7 ,9}
So we have 5 options.
The second selection is a letter from the set of all the letters (27) minus the set of the vowels (5)
So here we have 27 - 5 = 22 options
The third selection is also a letter from the previous set, but because each letter can be used only one time, and in the previous selection we already selected one of the letters, in this selection we have a letter less than in the previous selection.
Here we have 22 - 1 = 21 options.
The total number of combinations (of possible codes) is equal to the product of the number of options for each selection:
C = 5*22*21 = 2310.
There are 2310 different possible codes
Answer:
C) ![x^{27} (\sqrt[3]{y} )](https://tex.z-dn.net/?f=x%5E%7B27%7D%20%28%5Csqrt%5B3%5D%7By%7D%20%29)
Step-by-step explanation:
Answer:
Step-by-step explanation:
Let p be the number of trees Wangari plants, and h be the time she spends planting them in hours.
We have been given that Wangari plants trees at a constant rate of 12 trees every 3 hours.
Let us find number of trees planted in 1 hour by dividing 12 by 3.
We can represent this information as:
Therefore, the equation relates the number of trees (p) Wangari plants, and the time (h) she spends planting them in hours.
