Answers are grounded in this paper and cite their sources.
Let n 1 < n 2 < … be the sequence of positive integers whose base b representations involve the digit t ≦ b —1 at most d—1 times. B. D. Craven [2] shows that Σ i 1/n i converges by giving an upper bound for this sum as a function of b and d .
No takes yet. Share an insight, caveat, or question.
Ralph Alexander (1971) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: