I would greatly appreciate it if someone could take a look at my code and explain to me why the greatest common divisor always returns as 1. I am using Euclid\'s algorithm t
