human
Find smallest values of x and y such that ax | To find GCD using Eculcid 's algorithm.
Prints smallest values of x and y that satisfy " ax ▁ - ▁ by ▁ = ▁ 0".
Find LCM.
Driver code"
How can the above be solved in Python?
assistant
#Here is code to find smallest values of x and y such that ax and the other steps required.
 def gcd ( a , b ) :
	if ( b == 0 ) :
		return a
	return ( gcd ( b , a % b ) )
def findSmallest ( a , b ) :
	lcm = ( a * b ) / gcd ( a , b )
	print ( " x ▁ = " , lcm / a ,   " y =   " , lcm / b )
a = 25
b = 35
findSmallest ( a , b )