Products of integers with few nonzero digits

Abstract: Let

s (n)

be the number of nonzero bits in the binary digital expansion of the integer

n

. We study, for fixed

k, e l l, m

, the Diophantine system

s(ab)=k, quad s(a)=ell,quad mbox{and }quad s(b)=m,

in odd integer variables

a, b

. When

k = 2

or

k = 3

, we establish a bound on

a b

in terms of

e l l

and

m

. While such a bound does not exist in the case of

k = 4

, we give an upper bound for

m i n a, b

in terms of

e l l

and

m

.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: Products of integers with few nonzero digits