2014
DOI: 10.1007/s10474-014-0394-4
|View full text |Cite
|
Sign up to set email alerts
|

On Simultaneous Digital Expansions of Polynomial Values

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).

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
10
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(10 citation statements)
references
References 9 publications
0
10
0
Order By: Relevance
“…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
confidence: 94%
“…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
confidence: 94%
“…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.…”
Section: Introductionmentioning
confidence: 78%
“…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%
See 1 more Smart Citation