Number TheoryChallengeFactors & Multiples ShareFactors & Multiples · Challenge problemWhich condition on positive integers a,b,ca, b, ca,b,c is EQUIVALENT to gcd(a,b,c)⋅lcm(a,b,c)=abc\gcd(a, b, c)\cdot\text{lcm}(a, b, c) = abcgcd(a,b,c)⋅lcm(a,b,c)=abc?Agcd(a,b,c)=1\gcd(a, b, c) = 1gcd(a,b,c)=1Ba,b,ca, b, ca,b,c are pairwise coprimeCIt always holdsDOnly when a=b=c=1a = b = c = 1a=b=c=1Check Show answer Walk through it step by step Practice more like this Review this concept