As n ranges over the positive integers, what is the maximum possible value that the greatest common divisor of 13n+8 and 5n+3 can take?
By the Euclidean Algorithm, the maximum value is 10.
