Let a<b<c be positive, pairwise relatively prime integers, i.e. (a,b)=(b,c)=(a,c)=1

Without loss of generality, show that (a^2bc , ax+1)=1, where x=(-a-b-c)(ab+bc+ac)^{-1} (\bmod abc) . Note: I have already shown that gcd(ab+bc+ac , abc)=1, so x is well-defined. See http://www.mathhelpforum.com/math-he...e-theorem.html

Or give a counterexample. *I know this looks random and complicated, but this result has implications for Carmichael Numbers.