
Shane S. answered 09/07/20
Expert tutor in Discrete Mathematics and Combinatorics
It is a theorem that gcd(2x-1,2y-1)=2gcd(x,y)-1 (it is usually proven using the Euclidean algorithm)
This means that for your particular question, we can first compute gcd(120,100)=20 and then conclude that
gcd(2120-1,2100-1)=220-1