Answer:
Hello,
Answer TRUE.
Explanation:
a | n is read, a divide n.
if a | n => n=a*q
if b | n => b | a*q , since gcd(a,b)=1, b | q ==> b=q*k
n=a*q=a*b*k=(a*b)*k so a*b | n
1.6m questions
2.0m answers