Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Theorem 2, p. 1 of the arXiv PDF; proof pp. 4--5. Read in the text layer and checked on the rendered pages.

Statement

Let b≥2b\ge2 be an integer that is not a proper power, and let g:N→Rg:\mathbb{N}\to\mathbb{R} be continuous and nondecreasing with g(n+1)/g(n)→1g(n+1)/g(n)\to1. Let f:N→Nf:\mathbb{N}\to\mathbb{N} be nondecreasing with f(n+1)/f(n)∼g(n)f(n+1)/f(n)\sim g(n), and let α\alpha be the real number whose base-bb expansion is 0.f(1)f(2)f(3)…0.f(1)f(2)f(3)\ldots, the digits of f(1)f(1) followed by those of f(2)f(2), and so on. If α\alpha is rational, then g(n)g(n) tends to a limit cc that is a power of bb, and f(n+1)−cf(n)f(n+1)-cf(n) is bounded.

The paper notes that rational α\alpha do occur: b=10b=10, f(n)=(10n−1)/9f(n)=(10^n-1)/9, g(n)→10g(n)\to10, α=1/9\alpha=1/9. For f(n)=anf(n)=a^n with an integer a≥2a\ge2 the result is Mahler's for b=10b=10 and Bundschuh's for arbitrary bb, including proper powers.

Proof structure (pp. 4--5)

If α\alpha is rational its digit sequence is eventually periodic with some period pp; the fractional parts of log⁡bf(n)\log_bf(n) then have at most pp limit points, hence those of log⁡bg(n)\log_bg(n) have finitely many, and since log⁡bg(n+1)−log⁡bg(n)→0\log_bg(n+1)-\log_bg(n)\to0 the sequence g(n)g(n) converges to some cc. If log⁡c/log⁡b\log c/\log b is rational, a periodicity argument gives f(n+1)=cf(n)+O(1)f(n+1)=cf(n)+O(1) and shows cc rational and a rational power of bb, hence a power of bb as bb is not a proper power. If log⁡c/log⁡b\log c/\log b is irrational, equidistribution of {θn/p}\{\theta n/p\} for irrational θ\theta produces infinitely many nn for which f(n)f(n) is an initial digit segment of f(n+1)f(n+1), forcing f(n+1)=f(n)bk+O(bk)f(n+1)=f(n)b^k+O(b^k) and cc a power of bb, a contradiction.

Relation to problem 251

Problem 251 asks whether ∑pn/2n\sum p_n/2^n is irrational. Theorem 2 concerns the number whose base-bb digits are the concatenated digits of f(n)f(n); a weighted sum ∑f(n)/bn\sum f(n)/b^n is not of that form, because the base-bb digits of f(n)f(n) (about log⁡bn\log_bn of them for f(n)=pnf(n)=p_n) overlap when placed at position nn, with carries. For f(n)=pnf(n)=p_n the concatenation is the Copeland–Erdős number, not the series of problem 251. The theorem is therefore related to problem 251 by analogy only and records no progress on it; it is filed because this card's earlier digest singled it out.

Bears on. #251 (a mention that explains why the theorem does not apply).