Mean: 81.5
median: 22 + 89 / 2 = 55.5
mode: 98
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;
![15015=30\times 495 +165](https://tex.z-dn.net/?f=15015%3D30%5Ctimes%20495%20%2B165)
![495=3\times 165 +0](https://tex.z-dn.net/?f=495%3D3%5Ctimes%20165%20%2B0)
The last remainder before zero is the greatest common divisor.
Therefore ![gcd(15015,495)=165](https://tex.z-dn.net/?f=gcd%2815015%2C495%29%3D165)
Answer:
B. Brand B
Step-by-step explanation:
![\left|\begin{array}{cccc}$Brand&$Total Sold&$Returns&$Probability of Returns\\---&---&---&---\\$Brand A&343&17&\dfrac{17}{343}=0.0496 \\\\$Brand B&180&14&\dfrac{14}{180}=0.0778 \\\\$Brand C&383&16&\dfrac{16}{383}=0.0418\\\\$Brand D&246&8&\dfrac{8}{246}=0.0325\\&&&\end{array}\right|](https://tex.z-dn.net/?f=%5Cleft%7C%5Cbegin%7Barray%7D%7Bcccc%7D%24Brand%26%24Total%20Sold%26%24Returns%26%24Probability%20of%20Returns%5C%5C---%26---%26---%26---%5C%5C%24Brand%20A%26343%2617%26%5Cdfrac%7B17%7D%7B343%7D%3D0.0496%20%5C%5C%5C%5C%24Brand%20B%26180%2614%26%5Cdfrac%7B14%7D%7B180%7D%3D0.0778%20%5C%5C%5C%5C%24Brand%20C%26383%2616%26%5Cdfrac%7B16%7D%7B383%7D%3D0.0418%5C%5C%5C%5C%24Brand%20D%26246%268%26%5Cdfrac%7B8%7D%7B246%7D%3D0.0325%5C%5C%26%26%26%5Cend%7Barray%7D%5Cright%7C)
We can see from the table above that the experimental probability of returns of Brand B is the highest, therefore it has the highest likelihood of being returned.
The store should consider eliminating Brand B.