Use the division algorithm. If b = pa + r, then gcd(b,a) = gcd(a,r). Then you can apply the division algorithm again with a = qr + r' and gcd(a,r) = gcd(r, r'). Note that each time the square norm of the remainder gets smaller and smaller, so eventually this process will terminate and you can get the answer. Here, it should be 1.
The GCF is 6.
The GCF is 5x
3y plus 6x = 2
To find the number, multiply the divisor and quotient, then add the remainder. 9 (divisor) times 6 is 54. 54 plus 7 is 61. The number is 61.
x2 + 8xy + 15y2 = (x + 3y) (x + 5y)
The GCF is 4x4
5x3y4 + 8xy2 = xy2(5x2y2 + 8)
The greatest common factor (GCF) is 4.
The GCF is 6. 6(x + 2)
5m
The GCF is 5xy.
3x
2x3
5x
3
33x
The GCF is 6.