MATH135 Study Guide - Midterm Guide: Mathematical Induction, Extended Euclidean Algorithm, Euclidean Algorithm
![MATH135 Full Course Notes](https://new-docs-thumbs.oneclass.com/doc_thumbnails/list_view/2419643-class-notes-ca-u-of-waterloo-math-135-lecture29.jpg)
40
MATH135 Full Course Notes
Verified Note
40 documents
Document Summary
Instructions: print your name and id number in the boxes above, no calculators are permitted, the exam has 8 problems. Unless otherwise indicated, you must show all of your work: you may use any result from class without proof, un- less otherwise indicated or unless you are being asked to prove this result. This exam consists of 11 pages of paper in total, including the cover and the blank page: circle your section below. 010: furino, roh, akash, nayak, moosa, akash, wagner. 1. (a) use the extended euclidean algorithm or the euclidean algorithm and back-substitution to compute d = gcd(546, 360) and provide a certi cate that d is correct. x y. Since 6 | 546 and 6 | 360 and x = 29, y = 44 satisfy. 546x + 360y = 6 the gcd characterization theorem con rms that gcd(546, 360) = 6.