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:
13. 10a^4b²
14. -5y³ + 35y² - 10y
Step-by-step explanation:
Question 13:
(5a³b) (2ab) =
=10a^4b²
Question 14:
5y (-y² + 7y - 2) =
= -5y³ + 35y² - 10y
Hope this helps!
Answer:
C
Step-by-step explanation:
its a wild guess because you didn't add a picture or anything to show the pyramid
Answer:
A=SqRt(c^2-b^2)
Step-by-step explanation:
a^2 + b^2 = c^2
rearrange to solve for a^2
a^2= c^2-b^2
take the square root of each side
a= square root (c^2-b^2)
