COT3100Quiz04 - given for the answer and 4 points will be...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
COT 3100 Fall 2002 Pop Quiz #4 Date: 10/31/02 Name: _____________________ (Directions: Please show your work and circle your final answer to each question. No calculators permitted.) 1) (5 pts) Find the gcd(63,13) using Euclid's Algorithm. (Note that only one point will be
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: given for the answer, and 4 points will be given for the algorithm.) 2) (5 pts) Find one pair of integers x and y such that 63x + 13y = gcd(63, 13), using the method shown in class. (Only 1 point will be given for the answer, the rest for using the algorithm.)...
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online