Answer: i think $206.5
Step-by-step explanation:
correct me if i am wrong
Answer:
18
Step-by-step explanation:
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
Answer: Is in the screenshot
