lec0217 - Exam Statistics Average = 49.4/75 ~ 65.9% Stddev...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
Exam Statistics Average = 49.4/75 ~ 65.9% Stddev = 11.7 ~ 15.6% # Tests = 120 Score Range #people in range 65- 75 14 55.64 28 45.54 38 35.44 28 <35 12
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Euclid’s Algorithm The Greatest Common Divisor(GCD) of two integers is defined as follows: An integer c is called the GCD(a,b) (read as the greatest common divisor of integers a and b) if the following 2 conditions hold: 1) c | a c | b 2) For any common divisor d of a and b, d | c. Rule 2 ensures that the divisor c is the greatest of all the common divisors of a and b. One way we could find the GCD of two integers is by trial and error. Another way is that we could prime factorize each integer, and from the prime factorization, see which factors are common between the two integers. However, both of these become very time consuming as soon as the integers are relatively large. However, Euclid devised a fairly simple and efficient algorithm to determine the GCD of two integers. The algorithm basically makes use of the division algorithm repeatedly.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 6

lec0217 - Exam Statistics Average = 49.4/75 ~ 65.9% Stddev...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online