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
I just answered this question few minutes ago
yes, you are right
Based on the graph, f(3) = 5 when x = 3
Answer:for 5
Step-by-step explanation:1,5
Answer:
30
Step-by-step explanation:
Original Equation: 2(7 + 8)
So you have to multiply 2 by 7 which equals 14
Then you multiply 2 by 8 which equals 16
Your equation should now look like this: 14 + 16
Add 14 and 16 together.
Your answer is 30
Hope I helped :)
Please condsider brainliest
