(a) Use Euclid’s algorithm to find the g , the greatest common divisor of 273 and 3019.
1 answer:
You might be interested in
Answer:
0.077
Step-by-step explanation:
From the table :
Number of students aged 31 - 35 = 60
Number of students over 35 = 26
Total number of students = total possible outcomes = 1123
Required outcome = (students aged 31 - 35) + over 35 = 60 + 26 = 86
Probability = required outcome / Total possible outcomes
Probability (at least 31) = 86 / 1123 = 0.0765
= 0.077 (3 decimal places)
