Divide and Conquer – A Top Down Approach

Meeting #2. 3 Hour Team Practice. 5 Problems, A – E. 6 Pages, including this one Problem A: Euclid Problem. VA: 10104. From Euclid it is known that for any positive integers A and B there exist such integers X and Y that AX+BY=D, where D is the greatest common divisor of A and B. ................
................