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 system
s(ab)= k, s(a)= ℓ, and 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.
Language: English
Page range: 11 - 28
Submitted on: Jun 30, 2021
Accepted on: Nov 23, 2021
Published on: May 31, 2022
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year
Keywords:
Related subjects:
© 2022 Hajime Kaneko, Thomas Stoll, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.