Abstract:Abstract. Let sq denote the q-ary sum-of-digits function and let P1(X), P2(X) ∈ Z[X] with P1(N), P2(N) ⊂ N be polynomials of degree h, l ≥ 1, h = l, respectively. In this note we show that (sq(P1(n))/sq(P2(n))) n≥1 is dense in R + . This extends work by Stolarsky (1978) and Hare, Laishram and Stoll (2011).
“…Stolarsky also showed that the sequence s 2 (n r )/s 2 (n) is unbounded as n → ∞ (this is also true for sq(P (n)) sq(n) , see [6]). In very recent work, the authors [9] show that the ratio…”
Section: Introduction and Statement Of Resultsmentioning
Let q, r ≥ 2 be integers and denote by sq the sum-of-digits function in base q. In 1978, K. B. Stolarsky conjectured that lim N →∞ 1 N n≤N s2(n r) s2(n) ≤ r. In this paper we prove this conjecture. We show that for polynomials P1(X), P2(X) ∈ Z[X] of degrees r1, r2 ≥ 1 and integers q1, q2 ≥ 2 we have lim N →∞ 1 N n≤N sq 1 (P1(n)) sq 2 (P2(n)) = r1(q1 − 1) log q2 r2(q2 − 1) log q1. We also present a variant of the problem to polynomial values of prime numbers.
“…Stolarsky also showed that the sequence s 2 (n r )/s 2 (n) is unbounded as n → ∞ (this is also true for sq(P (n)) sq(n) , see [6]). In very recent work, the authors [9] show that the ratio…”
Section: Introduction and Statement Of Resultsmentioning
Let q, r ≥ 2 be integers and denote by sq the sum-of-digits function in base q. In 1978, K. B. Stolarsky conjectured that lim N →∞ 1 N n≤N s2(n r) s2(n) ≤ r. In this paper we prove this conjecture. We show that for polynomials P1(X), P2(X) ∈ Z[X] of degrees r1, r2 ≥ 1 and integers q1, q2 ≥ 2 we have lim N →∞ 1 N n≤N sq 1 (P1(n)) sq 2 (P2(n)) = r1(q1 − 1) log q2 r2(q2 − 1) log q1. We also present a variant of the problem to polynomial values of prime numbers.
“…For example, they showed that s(a 2 ) = s(a) = 8 only allows finitely many odd solutions a, whereas s(a 2 ) = s(a) = 12 has infinitely many odd solutions a. Note also, that due to a classical result of Stolarsky [18], we have lim inf a→∞ s(a 2 )/s(a) = 0, so that it may not be too rare to have integers a such that a 2 has a much lower number of nonzero bits than the integer a itself (the results hold true also for higher powers and in a more general context, see [9,11,[14][15][16]). Before going any further, let us first mention several related results for the nonzero bits of powers of integers from the literature that we will translate into our language.…”
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.
“…A related conjecture was made by Selfridge and Lacampagne [14, §7]. If we let B = {1, 2, 4, 5,7,11,13,14,16,20,22, . .…”
Section: Problem 4: Characterizing Representable Integersmentioning
confidence: 85%
“…Let s q (n) be the sum of the base-q digits of n. Madritsch and Stoll [16] showed that if P 1 and P 2 are polynomials with integer coefficients, of distinct degrees, such that P 1 (N), P 2 (N) ⊆ N, then the sequence of quotients (s q (P 1 (n))/s q (P 2 (n))) n≥1 is dense in R + .…”
Section: Problem 1: Densenessmentioning
confidence: 99%
“…By considering the numerator and denominator modulo 3 i , it is easy to see that if N ∈ D, then N ∈ V . Let 5,6,14,15,16,17,18,41,42,43,44,45,46, 47, . .…”
Section: Problem 4: Characterizing Representable Integersmentioning
A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of integers and rational numbers. For example, we show that the following problem is algorithmically decidable: given an integer N , determine if we can write N = A/B for palindromic numbers A and B. Given that N is representable, we find a bound on the size of the numerator of the smallest representation. We prove that the set of unrepresentable integers has positive density in N. We also obtain similar results for quotients of antipalindromic numbers (those for which the first half of the binary representation is the reverse complement of the second half). We also provide examples, numerical data, and a number of intriguing conjectures and open problems.
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.