Distance formula is like pythagoren ahtoerem
D=

the distance between oints (x1,y1) and (x2,y2) is
D=

(2,8) and (7,5)
D=

D=

D=

D=

apxos
D=5.8309....
round
D=5.8 units
This is not correct. It is not taking into account the 150 employees.
Answer:
5
Step-by-step explanation:
Assuming both players can answer the same question, the minimum number of questions is the smallest number that when multiplied by either 0.60 or 0.80 yields a whole number.
Let x be the number of questions, solving by trial and error:

Therefore, the minimum number of questions in the game is 5.
Turn each number into the product of it's prime factors.
32=16x2=2x2x2x2x2=2^5
48=24*2=6x4x2=2x3x2x2x2
Pick the highest number that occurs. In this case it is 2. Now we have to see how many times it appears in both. It appears 5 times in 32 and 4 times in 48. 4 is the highest number of times it appears in the numbers so:
2^4=2x2x2x2=16
The Greatest Common Factor (GCF) of 32 and 48 is 16.