Using Euclid's algorithm, the first number you check is their difference:
60 - 48 = 12
Since 12 divides both numbers evenly, that is your GCF.
_____
If the difference does not divide both numbers evenly, you can repeat the procedure with the difference and the remainder from dividing the smallest of the other numbers by the difference. For example, ...
GCF(60, 44) = GCF(44 mod 16, 16) = GCF(12, 16) = 4
44 minutes, 28+16 = 44
There is 60 minutes in an hour
The answer is $2.00 hope this helps
Answer:
200< 15p +35 (it's less than or equal to, but i can't put the bar under the sign)
Step-by-step explanation:
Answer:
equilateral acute
Step-by-step explanation: