I don't even know where to start with this. -_-
As A and B range over all ordered pairs of distinct coprime positive integers, how many different possibilities are there for:
gcd((A+B)^12, (A-B)^61)
As A and B range over all ordered pairs of distinct coprime positive integers, how many different possibilities are there for:
gcd((A+B)^12, (A-B)^61)