Answer:
Step-by-step explanation:
Not sure what form you need this in, but it really doesn't matter, as you'll see in the final equation. I used the vertex form and solved for a:
We are given the vertex (h, k) as the origin (0, 0), and we have a point that the graph goes through as (4, -64). That's our x and y. Plugging in what we have:
gives us
-64 = 16a and
a = -4. That means that the quadratic equation is
which is both vertex form and standard form here, no difference.
Answer:
34,220
Step-by-step explanation:
Because order doesn't matter, but the numbers can't be repeated, we need to find the number of combinations where 3 individual numbers can be chosen out of 60 possible numbers using the binomial coefficient:
Thus, Elias can make 34,220 unique 3-number codes given 60 different numbers.
Answer:
Each song cost $2
Step-by-step explanation:
2 times 11 is 22
Make me brainliest if this helps!
Answer:
45.75
Step-by-step explanation:
183/4=45.75.
Answer:
Can a polyhedron have for its faces 3 triangles? A polyhedron is bounded by four or more than four polygonal faces. No, it is not possible that a polyhedron has 3 triangles for its faces.
Step-by-step explanation:
Please mark as brainliest