Logo
ScienceStack
Table of Contents
Fetching ...
Sign In

Ellipsephic harmonic series revisited

Jean-Paul Allouche, Yining Hu, Claude Morin

Abstract

Ellipsephic or Kempner-like harmonic series are series of inverses of integers whose expansion in base $B$, for some $B \geq 2$, contains no occurrence of some fixed digit or some fixed block of digits. A prototypical example was proposed by Kempner in 1914, namely the sum inverses of integers whose expansion in base $10$ contains no occurrence of a nonzero given digit. Results about such series address their convergence as well as closed expressions for their sums (or approximations thereof). Another direction of research is the study of sums of inverses of integers that contain only a given finite number, say $k$, of some digit or some block of digits, and the limits of such sums when $k$ goes to infinity. Generalizing partial results in the literature, we give a complete result for any digit or block of digits in any base.

Ellipsephic harmonic series revisited

Abstract

Ellipsephic or Kempner-like harmonic series are series of inverses of integers whose expansion in base , for some , contains no occurrence of some fixed digit or some fixed block of digits. A prototypical example was proposed by Kempner in 1914, namely the sum inverses of integers whose expansion in base contains no occurrence of a nonzero given digit. Results about such series address their convergence as well as closed expressions for their sums (or approximations thereof). Another direction of research is the study of sums of inverses of integers that contain only a given finite number, say , of some digit or some block of digits, and the limits of such sums when goes to infinity. Generalizing partial results in the literature, we give a complete result for any digit or block of digits in any base.
Paper Structure (3 sections, 3 theorems, 31 equations)

This paper contains 3 sections, 3 theorems, 31 equations.

Table of Contents

  1. Introduction
  2. "Reducing" the problem
  3. Statements and Declarations

Key Result

Proposition 1

Let $w$ be a nonempty string over the alphabet $[0, B-1]$, Then, for all $k\geq 0$, where the sum is over $n\geq 1$ if $w=0^j$ and $n\geq 0$ otherwise.

Theorems & Definitions (7)

  • Proposition 1
  • proof
  • Lemma 2
  • Theorem 3
  • proof
  • Remark 1
  • Remark 2