Answer:
30,240 ways, if I am restricted to using A, B, and C for letters
Step-by-step explanation:
This uses Combinatorics from Discrete Math.
so.
3 letters and 4 digits.
26 letters from alphabet, but you want to choose first letters. no repeats...
Does this mean only letters A, B, and C ?
digits from 10 digits...
I imagine 7 empty slots , and the number of ways they occur together is by the product of the number of choices each box has.
3*2*1 * 10*9*8*7 = 6 * 5040 = 30,240 ways
<span>first stack = 12 blocks second stack = 12 + 3 = 15 blocks third stack = 15 - 7 = 8 12 + 15 + 8 = 35 blocks
So: D XDD
</span>
A. See the picture for steps
Answer:
2
Step-by-step explanation:
0(162/3125)+1(162/625)+2(216/625)+3(144/625)+4(48/625)+5(32/3125)
= 2
Question says that the graph of function g is a vertical stretch of the graph of function f by a factor of 3.
Now we have to find about which equation describes function g.
We know that if f(x) is the given function then a*f(x) gives vertical stretch or compress by a factor of a.
when 0<a<1 then it compresses by factor of a.
when a>1 then it stretches vertically by factor of a.
Given that function f is stretched by a factor of a so that means we use a=3 in formula a*f(x)
Hence final answer will be g(x)=3f(x).
So choice A is correct answer.
