This is the easiest way to solve this problem:
Imagine this represents how many combinations you can have for each of the 4 wheels (each blank spot for one wheel): __ __ __ __
For the first situation it says how many combos can we make if no digits are repeated.
We have 10 digits to use for the first wheel so put a 10 in the first slot
10 __ __ __
Since no digit can be repeated we only have 9 options for the second slot
10 9_ __ __
Same for the third slot, so only 8 options
<u>10</u> <u> 9 </u> <u> 8 </u> __
4th can't be repeated so only 7 options left
<u>10</u> <u> 9 </u> <u> 8 </u> <u> 7
</u><u>
</u>Multiply the four numbers together: 10*9*8*7 = 5040 combinations
For the next two do the same process as the one above.
If digits can be repeated? You have ten options for every wheel so it would look like this: <u>10</u> <u>10</u> <u>10</u> <u>10
</u>
10*10*10*10 = 10,000 combinations
If successive digits bust be different?
We have 10 for the first wheel, but second wheel only has 9 options because 2nd number can't be same as first. The third and fourth wheels also has 9 options for the same reason.
<u>10</u> <u> 9</u><u> </u> <u> 9 </u> <u> 9 </u>
10*9*9*9 = 7290 combinations
Answer:
22,200 words per hour
step-by-step explanation:
60 minutes per hour
370 words per minute
370(60)
22,200
Hello!
The parent function, y = ln(x), has a vertical and horizontal translation.
y = ln(x - h) + k | In this equation, h is the vertical shift, and k is the horizontal shift.
If ln(x - k), then the graph is translated right k units.
If ln(x + k), then the graph is translated left k units.
If ln(x) + h, then the graph is translated up h units.
If ln(x) - h, then the graph is translated down h units.
Therefore, the graph of y = ln(x - 7) + 3 is translated 3 units up and 7 units to the right, which is choice D.
Answer:
i think 4 th option
if u want to verify just substitute (4,-2)
10 cups (there are 4 cups in a quart, so 4+4+2)
5 pints (there are 2 pints in a quart, so 2+2+1)
