Waiting for answer This question has not been answered yet. You can hire a professional tutor to get the answer.
QUESTION
For positive integers a and b, the greatest common divisor of a and b is the largest postive integer that divides both a and b, denoted gcd(a, b).
For positive integers a and b, the greatest common divisor of a and b is the largest postive
integer that divides both a and b, denoted gcd(a, b). For p a prime number, prove that p
divides a and p divides b if and only if p divides gcd(a, b).
