human
Minimum multiplications with { 2 , 3 , 7 } to make two numbers equal | Function to find powers of 2 , 3 and 7 in x.
To keep count of each divisor.
To store the result.
Count powers of 2 in x.
Count powers of 3 in x.
Count powers of 7 in x.
Remaining number which is not divisible by 2 , 3 or 7.
Function to return the minimum number of given operations required to make a and b equal.
a = x * 2 ^ a1 * 3 ^ a2 * 7 ^ a3 va [ 0 ] = a1 va [ 1 ] = a2 va [ 2 ] = a3 va [ 3 ] = x.
Similarly for b.
If a and b cannot be made equal with the given operation . Note that va [ 3 ] and vb [ 3 ] contain remaining numbers after repeated divisions with 2 , 3 and 7. If remaining numbers are not same then we cannot make them equal ..
Minimum number of operations required.
Driver code"
Solution in Python:

=====
Give me a code to minimum multiplications with { 2 , 3 , 7 } to make two numbers equal and the other steps required?
assistant
#Here is code to minimum multiplications with { 2 , 3 , 7 } to make two numbers equal and the other steps required.
 def Divisors ( x ) :
	c = 0
	v = [ ]
	while ( x % 2 == 0 ) :
		c += 1
		x /= 2
	v . append ( c )
	c = 0
	while ( x % 3 == 0 ) :
		c += 1
		x /= 3
	v . append ( c )
	c = 0
	while ( x % 7 == 0 ) :
		c += 1
		x /= 7
	v . append ( c )
	v . append ( x )
	return v
def MinOperations ( a , b ) :
	va = Divisors ( a )
	vb = Divisors ( b )
	if ( va [ 3 ] != vb [ 3 ] ) :
		return - 1
	minOperations = abs ( va [ 0 ] - vb [ 0 ] ) + abs ( va [ 1 ] - vb [ 1 ] ) + abs ( va [ 2 ] - vb [ 2 ] )
	return minOperations
if __name__ == ' _ _ main _ _ ' :
	a = 14
	b = 28
	print ( MinOperations ( a , b ) )