Wednesday

July 30, 2014

July 30, 2014

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

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)

**Related Questions**

Pre-Calc - I'm so stuck-this stuff is so far above me right now-Please help ...

discrete math - prove that if n is an integer and 3n+2 is even, then n is even ...

Math. - How Do You Solve 18 m=8? I Don't Even Know Where To Start.

Math - Limit as n approaches infinity: [(n + 3)/(n + 1)]^n How do I even start ...

Precalculus - Write the simplest polynomial equation with real coefficients ...

Math f(x) - given f(x)= x^2+x and g(x)=2x+1 determine f[g(x)] i dont even know ...

math 5th - number puzzles You say this number when you start at 0 and count by ...

Math - How do I solve: log6 (x^2-5x) = 1 1/2log5(r-2)-log5 r) log2 (x-1/x^8) I ...

trig - Regarding the trigonometric series, Why does cos start with a 1 and why ...

physical education - What side do you start on in a doubles game? even side, odd...