Answer:
6 is the GCF of 30 and 66
Step-by-step explanation:
The GCF of two non-zero integers, x(30) and y(66), is the greatest positive integer m(6) that divides both x(30) and y(66) without an remainder.
