2(-3-7)+5= <span>2(-10)+5= -20 + 5= -15
-15 is your final answer</span>
A certain four-cylinder combination lock has 50 numbers on it.
It is a four cylinder combination lock
Each cylinder has 50 numbers
So we have to choose 4 numbers for 4 cylinders
_____ , ______ , ______, _____
you turn to a number on the first cylinder
We have 50 numbers so we have 50 combinations
__50___ , ______ , ______, _____
Repetitions are allowed so we do the same for remaining three
50 , 50 , 50 , 50
50 * 50 * 50* 50 = 6250000
There are 6250000 different lock combinations .
Answer:
1/8
Step-by-step explanation:
To simplify the expression √3/√8, we can first simplify the square root terms by finding the prime factorization of each number under the square root. The prime factorization of 3 is 3, and the prime factorization of 8 is 2 * 2 * 2.
We can then rewrite the square root terms as follows:
√3/√8 = √(3) / √(2 * 2 * 2)
Next, we can use the property of square roots that says that the square root of a number is equal to the square root of each of its prime factors. This means that we can rewrite the square root term as follows:
√(3) / √(2 * 2 * 2) = √(3) / √(2) / √(2) / √(2)
Since the square root of a number is the same as the number itself, we can simplify the expression further by removing the square root symbols from the prime numbers 2:
√(3) / √(2) / √(2) / √(2) = √(3) / 2 / 2 / 2
Finally, we can use the rules of division to simplify the expression even further:
√(3) / 2 / 2 / 2 = √(3) / (2 * 2 * 2)
Since any number divided by itself is equal to 1, we can simplify the expression one last time to get our final answer:
√(3) / (2 * 2 * 2) = 1/2 * 1/2 * 1/2 = 1/8
Therefore, the simplified form of the expression √3/√8 is 1/8.
Answer: 
for number 7
Step-by-step explanation:
a²+b²=c²
3²+8²=c²
9+64=c²
Answer:
640.5 cm^2
Step-by-step explanation:
So the formula for trapezoid is height times the average of the bases. So 25+36=61, and then we divide that by 2 to get 30.5 as our average. Then, we take 30.5 and multiply it by 21 and we get 640.5.
