Finding which combination of numbers requires the most mod operations to find the GCD
I need to write a program where I give the program an integer n. This program will then find which combination of numbers from 1 to n will take the most amount of modulus operations to find the GCD using the Euclidean Algorithm. I don't really have any idea where to start. I know that I will basically have to test every case (1, 1), (1,2), (1,3).... (1,n) and save the amount of modulus operations it takes each one to find the GCD, then move on to (2,1), (2,2).... (2,n) and do the same thing, then find which one out of all of them had the most modulus operations. Any idea on where I should start or what I should read up on to get started?
Topic archived. No new replies allowed.