Abstract

Let sq(n)s_q(n) denote the sum of the digits in the qq-ary expansion of an integer nn. In 2005, Melfi examined the structure of nn such that s2(n)=s2(n2)s_2(n) = s_2(n^2). We extend this study to the more general case of generic qq and polynomials p(n)p(n), and obtain, in particular, a refinement of Melfi's result. We also give a more detailed analysis of the special case p(n)=n2p(n) = n^2, looking at the subsets of nn where sq(n)=sq(n2)=ks_q(n) = s_q(n^2) = k for fixed kk.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.