45 is the answer. It is the least common multiple of 5 and 9. Multiples of 5: 5, 10,15,20,25, 30, 35, 40, 45 and multiples of 9: 9, 18, 27, 36, 45
According to sources, the most probable answer to this query is that thee results seems to support a .05 probability. Meaning, this supports the hypothesis' claim. Thank you for your question. Please don't hesitate to ask in Brainly your queries.
Most of the information's required for solving the question is already given in the question.
Height of the building that casts a shadow of 20 m = 32 m
Then
Height of the man that casts a shadow of 1.2 m = (32/20) * 1.2 meter
= 3.2 * 1.2 meter
= 3.84 meter
So the actual height of the person casting a shadow of 1.2 meter is 3.84 meters. I hope that the procedure used for solving the problem is easy enough for you to understand. You can definitely use this method in future for solving problems of similar type without requiring any additional help from outside.
The point of elimination is to have one variable so example
3x + 2y = 4
7X + 3y = 5
1) Try to find a way to have one variable
7(3x + 2y = 4) ----> 21x + 14y = 28
-3(7x+ 3y = 5) -----> -21x -9y = -15
2) add
0 + 5y = 13
3) solve for the last variable
5y = 13
y = 13/5 = 2 3/5 = 2.8
4) Subsitute the variable to get the other one
3x + 2(2.8) = 4
3x + 5.6 = 4
3x = -1.6
x = 0.533333333 (continue)
The intersection would be 0.53 with a line above the 3 and 2.8. (0.5333 , 2.8)
Hope you understand!!
Answer:
"greatest common factor" (GCF) or "greatest common divisor" (GCD)
Step-by-step explanation:
Apparently, you're looking for the term that has the given definition. It is called the GCF or GCD, the "greatest common factor" or the "greatest common divisor."
_____
The GCF or GCD can be found a couple of ways. One way is to find the prime factors of the numbers involved, then identify the lowest power of each of the unique prime factors that are common to all numbers. The product of those numbers is the GCF.
<u>Example</u>:
GCF(6, 9)
can be found from the prime factors:
The unique factors are 2 and 3. Only the factor 3 is common to both numbers, and its lowest power is 1. Thus ...
GCF(6, 9) = 3¹ = 3
__
Another way to find the GCD is to use Euclid's Algorithm. At each step of the algorithm, the largest number modulo the smallest number is found. If that is not zero, the largest number is replaced by the result, and the process repeated. If the result is zero, the smallest number is the GCD.
GCD(6, 9) = 9 mod 6 = 3 . . . . . (6 mod 3 = 0, so 3 is the GCD)
