O X Alt+S * C\Users\micha\OneDrive\Documents\winter 2018\comp 367 umbers, equivalence relations GCD, Euclid's algorithm Mast332-Comp367-Winter 2018-Assignmenti.mw* - [Server 3] - Maple 2017 File Edit View Insert Format Table Drawing Plot Tools Window Help DE 268 KG A A PT>DEE n !! ! @ # C P QQ Search Palettes Workbook Mast332-Comp367-Lecture1-Notes-Numbers.mw X Most332-Comp367-Vinter 20 18-Assignmenti.mw X Favorites Text Math Drawing PlotAnimation Expression | P Heading 1 - Serif || 18 V BI U B== II. :== Calculus Common Symbols YQuestion 1 Y Live Data Plots (A). (Ch. 3, Ex. 27, page 3) Prove that if (a, b) =1 and c divides a, then (a, b) =1: (B). Prove that if b = aq+r, then (a, r) = (b, a). (Hint: First show that the GCD of a and b, m=(b,a) divides 7, and then prove that a andr cannot have a common divisor larger than m). Variables Solution: Variable Value (A) Matrix Units (SI) Units (FPS) Layout Greek Components Ready H o Type here to search Maple Default Profile C:\Users'michalOneDrive Documents winter 2018\pomp 367'numbers, equivalence relations GCD, Euclids algorithm Memory: 4.18M Time: 0.15s Zoom: 125% Text Mode JO e PITA A A & 0 & (W US 2013-01-21 3 AN ENG 3:29 PM G 9 , 9 D = F2