gcd(a,b) is the greatest common divisor of a and b. It is the greatest number that can divide a and b.
example gcd(10,50) = 10 and gcd(5,7) = 1

For some reasons this solution requires you to only check if the version inside the given data is valid. No need to check the version parameter. The description is a little misleading/confusing.

You can click on padovan in the kata description. Or here.