Posted by **Peter** on Friday, November 15, 2013 at 2:13am.

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)

## Answer This Question

## Related Questions

- Math - I don't even know where to start with this. -_- As A and B range over all...
- math - (a). Is it true that for all set of positive integers a, b, c. gcd(a,c...
- Math (algebra) - Let x and y be real numbers satisfying 4x^2+5y^2=1. Over all ...
- college math question - Find the GCD of 24 and 49 in the integers of Q[sqrt(3...
- Math - Let S(n) denote the sum of digits of the integer n. Over all positive ...
- math - Part 1 In your own words, define the word “function.” Give your own ...
- Algebra - Joe picks 2 distinct numbers from the set of the first 14 positive ...
- Number Theory.,Math - How many ordered pairs of positive integers (a,b) are ...
- number theory, math - How many ordered pairs of positive integers (a,b) are ...
- MAths - 4 distinct integers p, q, r and s are chosen from the set {1,2,3,…,16,17...

More Related Questions