Abstract:Let s(n) be the number of nonzero bits in the binary digital expansion of the integer n. We study, for fixed k, ℓ, m, the Diophantine systemand s(b) = m, in odd integer variables a, b. When k = 2 or k = 3, we establish a bound on ab in terms of ℓ and m. While such a bound does not exist in the case of k = 4, we give an upper bound for min{a, b} in terms of ℓ and m.
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.