any of the 34 cars can finish first
any of the remaining 33 cars can finish second
any of the remaining 32 cars can finish third
Thus, the top 3 finishes can be done in (34)(33)(32) = 35904 ways
Answer:
The true statement is h < k ⇒ (3)
Step-by-step explanation:
∵ The equation of the graph is y =
+ k
∵ (-h, k) are the coordinates of its vertex point
∵ -h is the x-coordinate of the vertex point
∵ x-coordinate of the vertex point is -3
∴ -h = -3
→ Divide both sides by -1
∴ h = 3
∵ k is the y-coordinate of the vertex point
∵ y-coordinate of the vertex point is 4
∴ k = 4
∵ 3 < 4
→ That means h is smaller than k
∴ h < k
∴ The true statement is h < k
Answer:
answer is -7/2
Step-by-step explanation:
Answer:
hhhh
Step-by-step explanation:
B. 9 I think because it looks like it is bisected in the middle to cut into two equal parts. Please correct me if I am wrong. Thanks.