Abstract Let s ( n ) be the number of nonzero bits in binary digital expansion integer . We study, for fixed k, ℓ, m , Diophantine system ab )= a and b odd variables a, .When k =2 or = 3, we establish bound on terms ℓ While such does not exist case =4, give an upper min{ }
