Wiki
Wiki

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

Updated


Source. Printed p. 212, physical PDF p. 1, first paragraph, read on the page image.

Statement

The passage reads, with t>1t>1 an integer: "In my above paper I remarked that I cannot prove that any of the series

∑n=1∞φ(n)tn,∑n=1∞σ(n)tn,∑n=1∞ν(n)tn\sum_{n=1}^{\infty}\frac{\varphi(n)}{t^n},\qquad \sum_{n=1}^{\infty}\frac{\sigma(n)}{t^n},\qquad \sum_{n=1}^{\infty}\frac{\nu(n)}{t^n}

are irrational, where φ(n)\varphi(n) is Euler's φ\varphi function, σ(n)\sigma(n) the sum of the divisors of nn and ν(n)\nu(n) the number of distinct prime factors of nn." The "above paper" is footnote 1, "Indian Journal of Math. 12, 63--66 (1948)", the Lambert-series paper filed as erdos_1948_arithmetical_properties_lambert_series, whose closing remark on p. 66 first posed the three questions.

This is a statement of what the paper does not prove; no result in it concerns these three series. The rest of the paragraph records: that ∑1/tn+ν(n)\sum 1/t^{n+\nu(n)} and ∑1/tn−ν(n)\sum 1/t^{n-\nu(n)} can be proved irrational "by the methods used in the above paper" (no proof is given); that the author failed for ∑1/tn+d(n)\sum 1/t^{n+d(n)} and ∑1/tn−d(n)\sum 1/t^{n-d(n)} because he cannot show that the paper's (1),

max⁡m≤n(m+d(m))<min⁡m>n(m+d(m)),\max_{m\le n}\bigl(m+d(m)\bigr)<\min_{m>n}\bigl(m+d(m)\bigr),

holds for infinitely many nn (footnote 2: with ν(m)\nu(m) in place of d(m)d(m) this "is essentially contained in" the 1948 paper); and that he "cannot prove anything about" ∑1/tn+φ(n)\sum 1/t^{n+\varphi(n)}, ∑1/tn+σ(n)\sum 1/t^{n+\sigma(n)} and ∑1/tn+pn\sum 1/t^{n+p_n}, pnp_n the greatest prime factor of nn, since the analogue of (1) with φ\varphi, σ\sigma or the greatest prime factor in place of dd is false.

Relation to the catalog

Problem 249 asks the first question for t=2t=2, Problem 250 the second and Problem 69 the third (ν=ω\nu=\omega). The paper poses them for every integer base t>1t>1; the catalog fixes t=2t=2, and the all-base statement is a variant of each problem, not the problem. Theorem 1 of the same paper settles the exponent variants ∑1/tφ(n)\sum 1/t^{\varphi(n)} and ∑1/tσ(n)\sum 1/t^{\sigma(n)}, which are different series and say nothing about Problems 249 and 250.

Bears on. #249, #250 and #69, as a 1957 restatement of each question; the paper records no progress on any of them.