Find the greatest common divisor of 26 and 65

The greatest common divisor (GCD) of two numbers is the largest number that can divide both numbers without leaving a remainder. In this case, the GCD of 26 and 65 is 13.

To find the GCD, we can use the Euclidean Algorithm. This algorithm works by taking the larger number (in this case, 65) and subtracting the smaller number (in this case, 26) until the result is a number that is divisible by the smaller number.

In this case, the steps would be:

65 - 26 = 39

26 - 13 = 13

13 - 0 = 13

Therefore, the GCD of 26 and 65 is 13.