Coprimes satisfying a pair
No.  This is as hard as factoring, and there is no known efficient algorithm for factoring.  In particular, there is a standard reduction to show that if you could compute Euler's totient function efficiently, then you could factor efficiently.