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
The negative of it would be the positive so the answer is 1/4
Answer:
A. - 4
Step-by-step explanation:
f(4) = 4(4) - 20 = 16 - 20 = - 4
Answer:
It is 36
Step-by-step explanation:
minus × minus equals + so its 36
Step-by-step explanation:
I don't know the answer to this one so could someone please tell me
Thanks
