Question: Question 1. (5 marks) Let a, b = Z+, let c = ab gcd(a,b) Show that: (a) a | c and b | c;
Question 1. (5 marks) Let a, b = Z+, let c = ab gcd(a,b) Show that: (a) a | c and b | c; (b) If a | d and b | d, then c | d; (c) c = min{d EZ+: ad Ab|d}. (We use ":" for "such that" here to avoid confusing with the divisibility symbol "|".)
Step by Step Solution
3.43 Rating (172 Votes )
There are 3 Steps involved in it
Solution t... View full answer
Get step-by-step solutions from verified subject matter experts
