Unformatted text preview: 5 3 4 10 8 . 7) Determine the sum of the divisors in question #6. Programming Option: Write a program that automatically prints out all the steps of Euclid's Algorithm in an easy to read format. It should prompt the user for the two values for the GCD calcuation. If you do this question, you can skip questions #1, 2 and 3....
View Full Document
- Spring '09
- Greatest common divisor, Euclidean algorithm, integer solutions, Fundamental theorem of arithmetic, COT 3100H Spring, positive integer divisors