ANSWER
The greatest common divisor of 15,015 and 495 is 165.
<u>EXPLANATION</u>
We use the Euclidean Algorithm to compute the Greatest Common Divisor as follows;
The last remainder before zero is the greatest common divisor.
Therefore
HeLppppppp MeHHHHHH Thank youuuuuu
1 answer:
You might be interested in
Answer:
0.01260
Step-by-step explanation:
Data:
probability of population with cancer (positive) = 0.21
probability of population with cancer (negative) = 0.79
probability of population with cancer absent (positive) = 0.06
probability of population with cancer absent (negative) = 0.94
probility for positive test = P( cancer (positive)) × P ( cancer absent (positive)
=
Answer: view image. its a proof (in red)
Step-by-step explanation:
I got the first two but i cannot figure out the rest.
7.
8.
7.
8.